Collaboration diagram for General Graph Utilities:
![]() |
Files | |
file | graph_utils.h |
Graph utilities. | |
Functions | |
template<typename Graph, typename ItemIt> | |
int | lemon::countItems (const Graph &g) |
Function to count the items in the graph. | |
template<typename Graph> | |
int | lemon::countNodes (const Graph &g) |
Function to count the nodes in the graph. | |
template<typename Graph> | |
int | lemon::countEdges (const Graph &g) |
Function to count the edges in the graph. | |
template<typename Graph> | |
int | lemon::countUndirEdges (const Graph &g) |
Function to count the edges in the graph. | |
template<typename Graph> | |
Graph::Edge | lemon::findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge prev=INVALID) |
Finds an edge between two nodes of a graph. | |
template<typename Graph> | |
int | lemon::countOutEdges (const Graph &_g, const typename Graph::Node &_n) |
| |
template<typename Graph> | |
int | lemon::countInEdges (const Graph &_g, const typename Graph::Node &_n) |
|
|
This function counts the items in the graph. The complexity of the function is O(n) because it iterates on all of the items. Definition at line 46 of file graph_utils.h. |
|
This function counts the nodes in the graph. The complexity of the function is O(n) but for some graph structure it is specialized to run in O(1).
Definition at line 77 of file graph_utils.h. |
|
This function counts the edges in the graph. The complexity of the function is O(e) but for some graph structure it is specialized to run in O(1). Definition at line 102 of file graph_utils.h. |
|
This function counts the edges in the graph. The complexity of the function is O(e) but for some graph structure it is specialized to run in O(1). Definition at line 127 of file graph_utils.h. |
|
Finds an edge from node
If
u to v as it follows.
Definition at line 161 of file graph_utils.h. |
|
Definition at line 178 of file graph_utils.h. |
|
Definition at line 187 of file graph_utils.h. |