suurballe.h File Reference


Detailed Description

#include <vector>
#include <lemon/bin_heap.h>
#include <lemon/path.h>

Namespaces

namespace  lemon

Classes

class  Suurballe
 Implementation of an algorithm for finding edge-disjoint paths between two nodes having minimum total length. More...
class  Suurballe::ResidualDijkstra
 Special implementation of the Dijkstra algorithm for finding shortest paths in the residual network. More...


Generated on Sat Apr 19 14:16:54 2008 for LEMON by  doxygen 1.5.5