|
Files |
file | graph_utils.h |
| Graph utilities.
|
file | map_iterator.h |
| Iterators on the maps.
|
Classes |
class | ConEdgeIt |
| Iterator for iterating on edges connected the same nodes. More...
|
class | ConUEdgeIt |
| Iterator for iterating on uedges connected the same nodes. More...
|
class | GraphCopy |
| Class to copy a graph. More...
|
class | UGraphCopy |
| Class to copy an undirected graph. More...
|
class | MapIt |
| Iterator for maps with possibility of changing values. More...
|
class | ConstMapIt |
| Iterator for maps with possibility of getting values. More...
|
class | FilterMapIt |
| Iterator for maps which filters items by the values. More...
|
Defines |
#define | GRAPH_TYPEDEFS(Graph) |
| Creates convenience typedefs for the graph types and iterators.
|
#define | UNDIRGRAPH_TYPEDEFS(Graph) |
| Creates convenience typedefs for the undirected graph types and iterators.
|
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::countUEdges (const Graph &g) |
| Function to count the undirected edges in the graph.
|
template<typename Graph> |
int | lemon::countOutEdges (const Graph &_g, const typename Graph::Node &_n) |
| Function to count the number of the out-edges from node n .
|
template<typename Graph> |
int | lemon::countInEdges (const Graph &_g, const typename Graph::Node &_n) |
| Function to count the number of the in-edges to node n .
|
template<typename Graph> |
int | lemon::countIncEdges (const Graph &_g, const typename Graph::Node &_n) |
| Function to count the number of the inc-edges to node n .
|
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> |
Graph::UEdge | lemon::findUEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::UEdge prev=INVALID) |
| Finds an uedge between two nodes of a graph.
|
template<typename Target, typename Source, typename ItemIt, typename Ref> |
void | lemon::copyMap (Target &target, const Source &source, ItemIt it, const Ref &ref) |
| Copy a map.
|
template<typename Target, typename Source, typename ItemIt> |
void | lemon::copyMap (Target &target, const Source &source, ItemIt it) |
| Copy the source map to the target map.
|
template<typename Target, typename Source> |
GraphCopy< Target, Source > | lemon::copyGraph (Target &target, const Source &source) |
| Copy a graph to an other graph.
|
template<typename Target, typename Source> |
UGraphCopy< Target, Source > | lemon::copyUGraph (Target &target, const Source &source) |
| Copy a graph to an other graph.
|