This header file contains core utilities for LEMON. It is automatically included by all graph types, therefore it usually do not have to be included directly.
|
| template<typename Graph , typename Item > |
| int | countItems (const Graph &g) |
| | Function to count the items in a graph. More...
|
| |
| template<typename Graph > |
| int | countNodes (const Graph &g) |
| | Function to count the nodes in the graph. More...
|
| |
| template<typename Graph > |
| int | countRedNodes (const Graph &g) |
| | Function to count the red nodes in the graph. More...
|
| |
| template<typename Graph > |
| int | countBlueNodes (const Graph &g) |
| | Function to count the blue nodes in the graph. More...
|
| |
| template<typename Graph > |
| int | countArcs (const Graph &g) |
| | Function to count the arcs in the graph. More...
|
| |
| template<typename Graph > |
| int | countEdges (const Graph &g) |
| | Function to count the edges in the graph. More...
|
| |
| template<typename Graph > |
| int | countOutArcs (const Graph &g, const typename Graph::Node &n) |
| | Function to count the number of the out-arcs from node n. More...
|
| |
| template<typename Graph > |
| int | countInArcs (const Graph &g, const typename Graph::Node &n) |
| | Function to count the number of the in-arcs to node n. More...
|
| |
| 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. More...
|
| |
| template<typename GR > |
| bool | undirected (const GR &g) |
| | Check whether a graph is undirected. More...
|
| |
| template<typename From , typename To > |
| DigraphCopy< From, To > | digraphCopy (const From &from, To &to) |
| | Copy a digraph to another digraph. More...
|
| |
| template<typename From , typename To > |
| GraphCopy< From, To > | graphCopy (const From &from, To &to) |
| | Copy a graph to another graph. More...
|
| |
| template<typename From , typename To > |
| BpGraphCopy< From, To > | bpGraphCopy (const From &from, To &to) |
| | Copy a graph to another graph. More...
|
| |
| template<typename Graph > |
| Graph::Arc | findArc (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Arc prev=INVALID) |
| | Find an arc between two nodes of a digraph. More...
|
| |
| template<typename Graph > |
| Graph::Edge | findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge p=INVALID) |
| | Find an edge between two nodes of a graph. More...
|
| |