Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

lemon Namespace Reference


Detailed Description

Todo:
Some more detailed description would be nice here.


Classes

class  AlterationNotifier
 Registry class to register objects observes alterations in the graph. More...
class  AlterableGraphExtender
 Class to extend a graph with the functionality of alteration observing. More...
class  AlterableUndirGraphExtender
 Class to extend an undirected graph with the functionality of alteration observing. More...
class  ArrayMap
class  Bfs
 BFS algorithm class. More...
class  BinHeap
 A Binary Heap implementation. More...
struct  DefaultMapSelector
class  Dfs
 DFS algorithm class. More...
struct  DijkstraDefaultTraits
 Default traits class of Dijkstra class. More...
class  Dijkstra
 Dijkstra algorithm class. More...
class  DijkstraWizardBase
 Default traits used by DijkstraWizard. More...
class  DijkstraWizard
 A class to make easier the usage of Dijkstra algorithm. More...
class  ErrorMessage
 Exception-safe convenient "error message" class. More...
class  Exception
 Generic exception class. More...
class  LogicError
 One of the two main subclasses of Exception. More...
class  UninitializedParameter
 Exception for uninitialized parameters. More...
class  RuntimeError
 One of the two main subclasses of Exception. More...
class  RangeError
  More...
class  IOError
  More...
class  DataFormatError
  More...
class  AssertionFailedError
  More...
class  FibHeap
 Fibonacci Heap. More...
class  FullGraph
 A full graph class. More...
struct  DefaultReaderTraits
 Standard ReaderTraits for the GraphReader class. More...
class  QuotedStringReader
 Reader class for quoted strings. More...
class  GraphReader
 The graph reader class. More...
class  Color
 Data structure representing RGB colors. More...
struct  DefaultGraphToEpsTraits
 Default traits class of GraphToEps. More...
class  GraphToEps
 Helper class to implement the named parameters of graphToEps(). 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  NodeSubGraphWrapper
 A wrapper for hiding nodes from a graph. More...
class  EdgeSubGraphWrapper
 A wrapper for hiding edges from a graph. More...
class  SubBidirGraphWrapper
 A wrapper for composing a subgraph of a bidirected graph made from a directed one. More...
class  BidirGraphWrapper
 A wrapper for composing bidirected graph from a directed one. More...
class  ResGraphWrapper
 A wrapper for composing the residual graph for directed flow and circulation problems. More...
class  ErasingFirstGraphWrapper
 For blocking flows. More...
struct  DefaultWriterTraits
 Standard WriterTraits for the GraphWriter class. More...
class  QuotedStringWriter
 Writer class for quoted strings. More...
class  GraphWriter
 The graph writer class. 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  UndirListGraph
 An undirected list graph class. More...
class  MapIteratorBase
class  MapIterator
class  MapConstIterator
class  MapKeyIterator
class  MapValueIterator
class  MapConstValueIterator
class  MapConstKeySet
class  MapConstValueSet
class  MapValueSet
class  InversableMap
 General inversable map type. More...
class  DescriptorMap
 Provides a mutable, continous and unique descriptor for each item in the graph. More...
class  IdMap
 Provides an immutable and unique id for each item in the graph. More...
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  AddMap
 Sum of two maps. More...
class  ShiftMap
 Shift a maps with a constant. More...
class  SubMap
 Difference of two maps. More...
class  MulMap
 Product of two maps. More...
class  ScaleMap
 Scale a maps with a constant. More...
class  DivMap
 Quotient of two maps. More...
class  ComposeMap
 Composition of two maps. More...
class  NegMap
 Negative value of a map. More...
class  AbsMap
 Absolute value of a map. More...
class  FunctorMap
 Converts an STL style functor to a a map. More...
class  MapFunctor
 Converts a map to an STL style functor. More...
class  MaxMatching
 Edmonds' alternating forest maximum matching algorithm. 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  UndirPath
 A structure for representing undirected path in a graph. More...
class  Preflow
 Preflow algorithms class. More...
class  SmartGraphBase
 Base of SmartGraph. More...
class  SmartGraph
 A smart graph class. More...
class  UndirSmartGraph
 A smart undirected graph class. More...
class  Suurballe
 Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length. More...
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...
struct  True
 Basic type for defining "tags". A "YES" condidion for enable_if. More...
struct  False
 Basic type for defining "tags". A "NO" condidion for enable_if. 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...

Namespaces

namespace  concept
 The namespace of LEMON concepts and concept checking classes.

Functions

template<class GR, class LM>
DijkstraWizard< DijkstraWizardBase<
GR, LM > > 
dijkstra (const GR &g, const LM &l, typename GR::Node s=INVALID)
 
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 G>
GraphToEps< DefaultGraphToEpsTraits<
G > > 
graphToEps (G &g, std::ostream &os=std::cout)
 Generates an EPS file from a graph.
template<class G>
GraphToEps< DefaultGraphToEpsTraits<
G > > 
graphToEps (G &g, const char *file_name)
 Generates an EPS file from a graph.
template<typename Graph, typename ItemIt>
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 countEdges (const Graph &g)
 Function to count the edges in the graph.
template<typename Graph>
int countUndirEdges (const Graph &g)
 Function to count the edges in the graph.
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>
int countOutEdges (const Graph &_g, const typename Graph::Node &_n)
 
template<typename Graph>
int countInEdges (const Graph &_g, const typename Graph::Node &_n)
 
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::Value 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::Value 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 Sat Mar 19 10:58:47 2005 for LEMON by  doxygen 1.4.1