abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
Loading...
Searching...
No Matches
SuurballeDefaultTraits< GR , LEN > Struct Template Reference

Default traits class of Suurballe algorithm. More...

#include <lemon/suurballe.h>

Public Types

typedef GR Digraph
 The type of the digraph.
typedef LEN LengthMap
 The type of the length map.
typedef LEN::Value Length
 The type of the lengths.
typedef GR::template ArcMap< int > FlowMap
 The type of the flow map.
typedef GR::template NodeMap< Length > PotentialMap
 The type of the potential map.
typedef lemon::Path< Digraph > Path
 The path type.
typedef GR::template NodeMap< int > HeapCrossRef
 The cross reference type used for the heap.
typedef BinHeap< Length , HeapCrossRef > Heap
 The heap type used for internal Dijkstra computations.

Detailed Description

template< typename GR , typename LEN >
struct lemon::SuurballeDefaultTraits< GR , LEN >

Default traits class of Suurballe algorithm.

Template Parameters
GRThe digraph type the algorithm runs on.
LENThe type of the length map. The default value is GR::ArcMap< int >.

Member Typedef Documentation

◆ Path

template< typename GR , typename LEN >
typedef lemon::Path< Digraph > Path

The type used for storing the found arc-disjoint paths. It must conform to the Path concept and it must have an addBack() function.

◆ Heap

template< typename GR , typename LEN >
typedef BinHeap< Length , HeapCrossRef > Heap

The type of the heap used for internal Dijkstra computations. It must conform to the Heap concept and its priority type must be Length.