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

Path and Flow Algorithms
[Graph Algorithms]

Collaboration diagram for Path and Flow Algorithms:


Detailed Description


Files

file  bfs.h
 Bfs algorithm.
file  dfs.h
 DFS algorithm.
file  dijkstra.h
 Dijkstra algorithm.
file  min_cost_flow.h
 An algorithm for finding a flow of value k (for small values of k) having minimal total cost.
file  preflow.h
file  suurballe.h
 An algorithm for finding k paths of minimal total length.

Classes

class  Bfs
 BFS algorithm class. More...
class  Dfs
 DFS algorithm class. More...
class  Dijkstra
 Dijkstra algorithm class. More...
class  DijkstraWizard
 A class to make easier the usage of Dijkstra 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  Preflow
 Preflow algorithms class. More...
class  Suurballe
 Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length. More...

Functions

template<class GR, class LM>
DijkstraWizard< DijkstraWizardBase<
GR, LM > > 
lemon::dijkstra (const GR &g, const LM &l, typename GR::Node s=INVALID)
 


Function Documentation

DijkstraWizard<DijkstraWizardBase<GR,LM> > dijkstra const GR &  g,
const LM &  l,
typename GR::Node  s = INVALID
 

Todo:
Please document...

Definition at line 941 of file dijkstra.h.


Generated on Sat Mar 19 10:58:47 2005 for LEMON by  doxygen 1.4.1