![]() |
TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
Public Member Functions | |
| Edge (Edge &&)=default | |
| Edge & | operator= (Edge &&)=default |
| Edge (Edge const &)=default | |
| Edge & | operator= (Edge const &)=default |
| Edge (unsigned int source, unsigned int destination) | |
Public Attributes | |
| int | src |
| int | dst |
| int | weight |
| unsigned int | src |
| unsigned int | dest |
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.
|
inline |
Set the source and destination of the vertex.
| source | is the source vertex of the edge. |
| destination | is the destination vertex of the edge. |
Definition at line 41 of file cycle_check_directed_graph.cpp.
| unsigned int Edge::dest |
Definition at line 27 of file cycle_check_directed_graph.cpp.
| int Edge::dst |
Definition at line 10 of file bellman_ford.cpp.
| int Edge::src |
Definition at line 10 of file bellman_ford.cpp.
| unsigned int Edge::src |
Definition at line 26 of file cycle_check_directed_graph.cpp.
| int Edge::weight |
Definition at line 10 of file bellman_ford.cpp.