TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
Loading...
Searching...
No Matches
Edge Struct Reference

Public Member Functions

 Edge (Edge &&)=default
 
Edgeoperator= (Edge &&)=default
 
 Edge (Edge const &)=default
 
Edgeoperator= (Edge const &)=default
 
 Edge (unsigned int source, unsigned int destination)
 

Public Attributes

int src
 
int dst
 
int weight
 
unsigned int src
 
unsigned int dest
 

Detailed Description

Implementation of non-weighted directed edge of a graph.

The source vertex of the edge is labelled "src" and destination vertex is labelled "dest".

Definition at line 8 of file bellman_ford.cpp.

Constructor & Destructor Documentation

◆ Edge()

Edge::Edge ( unsigned int source,
unsigned int destination )
inline

Set the source and destination of the vertex.

Parameters
sourceis the source vertex of the edge.
destinationis the destination vertex of the edge.

Definition at line 41 of file cycle_check_directed_graph.cpp.

42 : src(source), dest(destination) {}

Member Data Documentation

◆ dest

unsigned int Edge::dest

Definition at line 27 of file cycle_check_directed_graph.cpp.

◆ dst

int Edge::dst

Definition at line 10 of file bellman_ford.cpp.

◆ src [1/2]

int Edge::src

Definition at line 10 of file bellman_ford.cpp.

◆ src [2/2]

unsigned int Edge::src

Definition at line 26 of file cycle_check_directed_graph.cpp.

◆ weight

int Edge::weight

Definition at line 10 of file bellman_ford.cpp.


The documentation for this struct was generated from the following files: