|
Classes |
| class | ConEdgeIt< _Graph > |
| | Iterator for iterating on edges connected the same nodes. More...
|
| class | ConUEdgeIt< _Graph > |
| | Iterator for iterating on uedges connected the same nodes. More...
|
| class | GraphCopy< To, From > |
| | Class to copy a graph. More...
|
| class | UGraphCopy< To, From > |
| | Class to copy an undirected graph. More...
|
| class | BpUGraphCopy< To, From > |
| | Class to copy a bipartite undirected graph. More...
|
| class | IdMap< _Graph, _Item > |
| | Provides an immutable and unique id for each item in the graph. More...
|
| class | InverseMap |
| | The class represents the inverse of its owner (IdMap). More...
|
| class | InvertableMap< _Graph, _Item, _Value > |
| | General invertable graph-map type. More...
|
| class | ValueIterator |
| | Forward iterator for values. More...
|
| class | InverseMap |
| | The inverse map type. More...
|
| class | DescriptorMap< _Graph, _Item > |
| | Provides a mutable, continuous and unique descriptor for each item in the graph. More...
|
| class | InverseMap |
| class | SourceMap< Graph > |
| | Returns the source of the given edge. More...
|
| class | TargetMap< Graph > |
| | Returns the target of the given edge. More...
|
| class | ForwardMap< Graph > |
| | Returns the "forward" directed edge view of an undirected edge. More...
|
| class | BackwardMap< Graph > |
| | Returns the "backward" directed edge view of an undirected edge. More...
|
| class | PotentialDifferenceMap< Graph, NodeMap > |
| | Potential difference map. More...
|
| class | InDegMap< _Graph > |
| | Map of the node in-degrees. More...
|
| class | OutDegMap< _Graph > |
| | Map of the node out-degrees. More...
|
| class | DynEdgeLookUp< G > |
| | Dynamic edge look up between given endpoints. More...
|
| class | EdgeLookUp< G > |
| | Fast edge look up between given endpoints. More...
|
| class | AllEdgeLookUp< G > |
| | Fast look up of all edges between given endpoints. More...
|
Namespaces |
| namespace | lemon |
| | The namespace of LEMON.
|
Defines |
| #define | GRAPH_TYPEDEFS(Graph) |
| | Creates convenience typedefs for the graph types and iterators.
|
| #define | UGRAPH_TYPEDEFS(Graph) |
| | Creates convenience typedefs for the undirected graph types and iterators.
|
| #define | BPUGRAPH_TYPEDEFS(Graph) |
| | Creates convenience typedefs for the bipartite undirected graph types and iterators.
|
Functions |
| template<typename Graph , typename Item > |
| int | countItems (const Graph &g) |
| | Function to count the items in the graph.
|
| template<typename Graph > |
| int | countNodes (const Graph &g) |
| | Function to count the nodes in the graph.
|
| template<typename Graph > |
| int | countANodes (const Graph &g) |
| | Function to count the anodes in the graph.
|
| template<typename Graph > |
| int | countBNodes (const Graph &g) |
| | Function to count the bnodes in the graph.
|
| template<typename Graph > |
| int | countEdges (const Graph &g) |
| | Function to count the edges in the graph.
|
| template<typename Graph > |
| int | countUEdges (const Graph &g) |
| | Function to count the undirected edges in the graph.
|
| template<typename Graph > |
| int | 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 | 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 | 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 | 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 | findUEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::UEdge p=INVALID) |
| | Finds an uedge between two nodes of a graph.
|
| template<typename To , typename From , typename ItemIt , typename Ref > |
| void | copyMap (To &to, const From &from, ItemIt it, const Ref &ref) |
| | Copy a map.
|
| template<typename To , typename From , typename ItemIt > |
| void | copyMap (To &to, const From &from, ItemIt it) |
| | Copy the from map to the to map.
|
| template<typename To , typename From > |
| GraphCopy< To, From > | copyGraph (To &to, const From &from) |
| | Copy a graph to another graph.
|
| template<typename To , typename From > |
| UGraphCopy< To, From > | copyUGraph (To &to, const From &from) |
| | Copy an undirected graph to another graph.
|
| template<typename To , typename From > |
| BpUGraphCopy< To, From > | copyBpUGraph (To &to, const From &from) |
| | Copy a bipartite undirected graph to another graph.
|
