This group contains maps that are specifically designed to assign values to the nodes and arcs/edges of graphs.
If you are looking for the standard graph maps (NodeMap
, ArcMap
, EdgeMap
), see the Graph Structure Concepts.
|
class | IdMap< GR, K > |
| Provides an immutable and unique id for each item in a graph. More...
|
|
class | CrossRefMap< GR, K, V > |
| General cross reference graph map type. More...
|
|
class | RangeIdMap< GR, K > |
| Provides continuous and unique ID for the items of a graph. More...
|
|
class | SourceMap< GR > |
| Map of the source nodes of arcs in a digraph. More...
|
|
class | TargetMap< GR > |
| Map of the target nodes of arcs in a digraph. More...
|
|
class | ForwardMap< GR > |
| Map of the "forward" directed arc view of edges in a graph. More...
|
|
class | BackwardMap< GR > |
| Map of the "backward" directed arc view of edges in a graph. More...
|
|
class | InDegMap< GR > |
| Map of the in-degrees of nodes in a digraph. More...
|
|
class | OutDegMap< GR > |
| Map of the out-degrees of nodes in a digraph. More...
|
|
class | PotentialDifferenceMap< GR, POT > |
| Potential difference map. More...
|
|
class | IdMap< GR, K >::InverseMap |
| This class represents the inverse of its owner (IdMap). More...
|
|
class | CrossRefMap< GR, K, V >::InverseMap |
| The inverse map type. More...
|
|
class | CrossRefMap< GR, K, V >::ValueIterator |
| Forward iterator for values. More...
|
|
class | RangeIdMap< GR, K >::InverseMap |
|
SourceMap< GR > sourceMap |
( |
const GR & |
graph | ) |
|
|
related |
This function just returns an SourceMap
class.
TargetMap< GR > targetMap |
( |
const GR & |
graph | ) |
|
|
related |
This function just returns a TargetMap
class.
ForwardMap< GR > forwardMap |
( |
const GR & |
graph | ) |
|
|
related |
BackwardMap< GR > backwardMap |
( |
const GR & |
graph | ) |
|
|
related |
PotentialDifferenceMap< GR, POT > potentialDifferenceMap |
( |
const GR & |
gr, |
|
|
const POT & |
potential |
|
) |
| |
|
related |