This group contains the skeletons and concept checking classes of graph structures.
Classes | |
| class | BpGraph | 
| Class describing the concept of undirected bipartite graphs.  More... | |
| class | Digraph | 
| Class describing the concept of directed graphs.  More... | |
| class | Graph | 
| Class describing the concept of undirected graphs.  More... | |
| class | BpGraph::Arc | 
| The arc type of the graph.  More... | |
| class | BpGraph::ArcIt | 
| Iterator class for the arcs.  More... | |
| class | BpGraph::ArcMap< T > | 
| Standard graph map type for the arcs.  More... | |
| class | BpGraph::BlueNode | 
| Class to represent blue nodes.  More... | |
| class | BpGraph::BlueNodeIt | 
| Iterator class for the blue nodes.  More... | |
| class | BpGraph::BlueNodeMap< T > | 
| Standard graph map type for the blue nodes.  More... | |
| class | BpGraph::Edge | 
| The edge type of the graph.  More... | |
| class | BpGraph::EdgeIt | 
| Iterator class for the edges.  More... | |
| class | BpGraph::EdgeMap< T > | 
| Standard graph map type for the edges.  More... | |
| class | BpGraph::InArcIt | 
| Iterator class for the incoming arcs of a node.  More... | |
| class | BpGraph::IncEdgeIt | 
| Iterator class for the incident edges of a node.  More... | |
| class | BpGraph::Node | 
| The node type of the graph.  More... | |
| class | BpGraph::NodeIt | 
| Iterator class for the nodes.  More... | |
| class | BpGraph::NodeMap< T > | 
| Standard graph map type for the nodes.  More... | |
| class | BpGraph::OutArcIt | 
| Iterator class for the outgoing arcs of a node.  More... | |
| class | BpGraph::RedNode | 
| Class to represent red nodes.  More... | |
| class | BpGraph::RedNodeIt | 
| Iterator class for the red nodes.  More... | |
| class | BpGraph::RedNodeMap< T > | 
| Standard graph map type for the red nodes.  More... | |
| class | Digraph::Arc | 
| The arc type of the digraph.  More... | |
| class | Digraph::ArcIt | 
| Iterator class for the arcs.  More... | |
| class | Digraph::ArcMap< T > | 
| Standard graph map type for the arcs.  More... | |
| class | Digraph::InArcIt | 
| Iterator class for the incoming arcs of a node.  More... | |
| class | Digraph::Node | 
| The node type of the digraph.  More... | |
| class | Digraph::NodeIt | 
| Iterator class for the nodes.  More... | |
| class | Digraph::NodeMap< T > | 
| Standard graph map type for the nodes.  More... | |
| class | Digraph::OutArcIt | 
| Iterator class for the outgoing arcs of a node.  More... | |
| class | Graph::Arc | 
| The arc type of the graph.  More... | |
| class | Graph::ArcIt | 
| Iterator class for the arcs.  More... | |
| class | Graph::ArcMap< T > | 
| Standard graph map type for the arcs.  More... | |
| class | Graph::Edge | 
| The edge type of the graph.  More... | |
| class | Graph::EdgeIt | 
| Iterator class for the edges.  More... | |
| class | Graph::EdgeMap< T > | 
| Standard graph map type for the edges.  More... | |
| class | Graph::InArcIt | 
| Iterator class for the incoming arcs of a node.  More... | |
| class | Graph::IncEdgeIt | 
| Iterator class for the incident edges of a node.  More... | |
| class | Graph::Node | 
| The node type of the graph.  More... | |
| class | Graph::NodeIt | 
| Iterator class for the nodes.  More... | |
| class | Graph::NodeMap< T > | 
| Standard graph map type for the nodes.  More... | |
| class | Graph::OutArcIt | 
| Iterator class for the outgoing arcs of a node.  More... | |
Files | |
| file | bpgraph.h | 
| The concept of undirected graphs.  | |
| file | digraph.h | 
| The concept of directed graphs.  | |
| file | graph.h | 
| The concept of undirected graphs.  | |
| file | graph_components.h | 
| The concepts of graph components.  | |
 1.8.2