Introduction
API reference
bellmanFord()
dijkstra()
Project
Declared in lemon/suurballe.h, in the group Shortest Path Algorithms; the same struct on the Doxygen site.
lemon/suurballe.h
Default traits class of Suurballe algorithm.
GR – The digraph type the algorithm runs on.
LEN – The type of the length map. The default value is GR::ArcMap< int >.
GR::ArcMap< int >
Public Types
The type of the digraph.
The type of the length map.
The type of the lengths.
The type of the flow map.
The type of the potential map.
The path type.
The type used for storing the found arc-disjoint paths. It must conform to the Path concept and it must have an addBack() function.
addBack()
The cross reference type used for the heap.
The heap type used for internal Dijkstra computations.
The type of the heap used for internal Dijkstra computations. It must conform to the Heap concept and its priority type must be Length.
Length