My Project
Loading...
Searching...
No Matches
List of all members | Public Types
SuurballeDefaultTraits< GR, LEN > Struct Template Reference

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>.

#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< LengthPotentialMap
 The type of the potential map.
 
typedef lemon::Path< DigraphPath
 The path type.
 
typedef GR::template NodeMap< int > HeapCrossRef
 The cross reference type used for the heap.
 
typedef BinHeap< Length, HeapCrossRefHeap
 The heap type used for internal Dijkstra computations.
 

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.