Detailed Description

Todo:
Some more detailed description would be nice here.


Classes

class  ArrayMap
class  Bfs
 BFS algorithm class. More...
class  BinHeap
 A Binary Heap implementation. More...
class  Dfs
 DFS algorithm class. More...
class  Dijkstra
 Dijkstra algorithm class. More...
class  FibHeap
 Fibonacci Heap. More...
class  FullGraph
 A full graph class. More...
class  GraphWrapper
 Base type for the Graph Wrappers. More...
class  RevGraphWrapper
 A graph wrapper which reverses the orientation of the edges. More...
class  SubGraphWrapper
 A graph wrapper for hiding nodes and edges from a graph. More...
class  SubBidirGraphWrapper
 A wrapper for composing a subgraph of a bidirected graph made from a directed one. More...
class  SubBidirGraphWrapper::Edge
class  SubBidirGraphWrapper::EdgeMap
class  BidirGraphWrapper
 A wrapper for composing bidirected graph from a directed one. More...
class  BidirGraph
 A bidirected graph template. More...
class  ResGraphWrapper
 A wrapper for composing the residual graph for directed flow and circulation problems. More...
class  ResGraphWrapper::ResCap
 Residual capacity map. More...
class  ErasingFirstGraphWrapper
 For blocking flows. More...
struct  Invalid
 See INVALID, how to use it. More...
class  NonConstMapWr
 Helper class for calling kruskal with "constant" output map. More...
class  KruskalMapInput
 Kruskal input source. More...
class  KruskalSequenceOutput
 A writable bool-map that makes a sequence of "true" keys. More...
class  ListGraph
 A list graph class. More...
class  SymListGraph
 Graph for bidirectional edges. More...
class  NodeSet
 A graph class containing only nodes. More...
class  NodeSet::EdgeMap
 Creating empty map structure for edges. More...
class  EdgeSet
 Graph structure using a node set of another graph. More...
struct  KeyInfo
 Helper class to get information about the key type. More...
class  MapIteratorBase
class  MapIterator
class  MapIterator::PairPointerType
 The pointer type of the iterator. More...
class  MapConstIterator
class  MapConstIterator::PairPointerType
 The pointer type of the iterator. More...
class  MapKeyIterator
class  MapValueIterator
class  MapConstValueIterator
class  MapConstKeySet
class  MapConstValueSet
class  MapValueSet
class  MapRegistry
class  MapRegistry::MapBase
class  MapRegistry::MapBase::NotSupportedOperationException
class  MapBase
 Base class of maps. More...
class  NullMap
 Null map. (a.k.a. DoNothingMap). More...
class  ConstMap
 Constant map. More...
class  StdMap
 std::map wrapper More...
class  MinCostFlow
 Implementation of an algorithm for finding a flow of value k (for small values of k) having minimal total cost between 2 nodes. More...
class  DirPath
 A structure for representing directed paths in a graph. More...
class  DirPath::EdgeIt
 Iterator class to iterate on the edges of the paths. More...
class  DirPath::NodeIt
 Iterator class to iterate on the nodes of the paths. More...
class  DirPath::Builder
 Class to build paths. More...
class  UndirPath
 A structure for representing undirected path in a graph. More...
class  UndirPath::EdgeIt
 Iterator class to iterate on the edges of the paths. More...
class  UndirPath::NodeIt
 Iterator class to iterate on the nodes of the paths. More...
class  UndirPath::Builder
 Class to build paths. More...
class  Preflow
 Preflow algorithms class. More...
class  SmartGraph
 A smart graph class. More...
class  SymSmartGraph
 Graph for bidirectional edges. More...
class  Suurballe
 Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length. More...
class  SymEdgeIt
class  SymMap
class  TimeStamp
 A class to store (cpu)time instances. More...
class  Timer
 Class measuring the cpu time and real time usage of the process. More...
class  UnionFind
 A Union-Find data structure implementation. More...
class  UnionFindEnum
 A Union-Find data structure implementation which is able to enumerate the components. More...
class  VectorMap
class  xy
 A two dimensional vector (plainvector) implementation. More...
class  BoundingBox
 A class to calculate or store the bounding box of plainvectors. More...

Functions

template<typename Graph, typename CapacityMap, typename CostMap> void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s, typename Graph::Node &t, CostMap &cost)
 Dimacs min cost flow reader function.
template<typename Graph, typename CapacityMap> void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s, typename Graph::Node &t)
 Dimacs max flow reader function.
template<typename Graph, typename CapacityMap> void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s)
 Dimacs shortest path reader function.
template<typename Graph, typename CapacityMap> void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity)
 Dimacs capacitated graph reader function.
template<typename Graph> void readDimacs (std::istream &is, Graph &g)
 Dimacs plain graph reader function.
template<typename Graph> void writeDimacs (std::ostream &os, const Graph &g)
 write matching problem
template<class GR, class IN, class OUT> IN::value_type::second_type kruskal (GR const &G, IN const &in, OUT &out)
 Kruskal's algorithm to find a minimum cost tree of a graph.
template<class GR, class Map> KruskalMapInput< GR, Map > makeKruskalMapInput (const GR &G, const Map &m)
 Creates a KruskalMapInput object for kruskal().
template<class GR, class IN, class RET> IN::ValueType kruskalEdgeMap (GR const &G, IN const &in, RET &out)
 Wrapper function to kruskal(). Input is from an edge map, output is a plain bool map.
template<class GR, class IN, class RET> IN::ValueType kruskalEdgeMap_IteratorOut (const GR &G, const IN &in, RET out)
 Wrapper function to kruskal(). Input is from an edge map, output is an STL Sequence.

Variables

const Invalid INVALID = Invalid()
 Invalid iterators.


Variable Documentation

const Invalid INVALID = Invalid()
 

Invalid is a global type that converts to each iterator in such a way that the value of the target iterator will be invalid. Definition at line 47 of file invalid.h.


Generated on Thu Sep 30 12:18:36 2004 for LEMON by doxygen 1.3.8