Graph Structure Concepts

Detailed Description

This group contains the skeletons and concept checking classes of LEMON's graph structures and helper classes used to implement these.

Classes
class	Digraph
	Class describing the concept of directed graphs. More...
class	Graph
	Class describing the concept of Undirected Graphs. More...
class	Digraph::Arc
	Class for identifying an arc of the digraph. More...
class	Digraph::ArcIt
	This iterator goes through each arc. More...
class	Digraph::ArcMap< T >
class	Digraph::InArcIt
	This iterator goes trough the incoming arcs of a node. More...
class	Digraph::Node
	Class for identifying a node of the digraph. More...
class	Digraph::NodeIt
	This iterator goes through each node. More...
class	Digraph::NodeMap< T >
class	Digraph::OutArcIt
	This iterator goes trough the outgoing arcs of a node. More...
class	Graph::Arc
	The directed arc type. More...
class	Graph::ArcIt
	This iterator goes through each directed arc. More...
class	Graph::ArcMap< T >
class	Graph::Edge
class	Graph::EdgeIt
	This iterator goes through each edge. More...
class	Graph::EdgeMap< T >
class	Graph::InArcIt
	This iterator goes trough the incoming directed arcs of a node. More...
class	Graph::IncEdgeIt
	This iterator goes trough the incident undirected arcs of a node. More...
class	Graph::Node
	The base type of node iterators, or in other words, the trivial node iterator. More...
class	Graph::NodeIt
	This iterator goes through each node. More...
class	Graph::NodeMap< T >
class	Graph::OutArcIt
	This iterator goes trough the outgoing directed arcs of a node. More...

Files
file	digraph.h
	The concept of directed graphs.
file	graph.h
	The concept of Undirected Graphs.
file	graph_components.h
	The concept of graph components.