equal
deleted
inserted
replaced
49 ///arcs of the shortest paths. |
49 ///arcs of the shortest paths. |
50 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. |
50 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. |
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap; |
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap; |
52 ///Instantiates a PredMap. |
52 ///Instantiates a PredMap. |
53 |
53 |
54 ///This function instantiates a PredMap. |
54 ///This function instantiates a PredMap. |
55 ///\param g is the digraph, to which we would like to define the |
55 ///\param g is the digraph, to which we would like to define the |
56 ///PredMap. |
56 ///PredMap. |
57 static PredMap *createPredMap(const Digraph &g) |
57 static PredMap *createPredMap(const Digraph &g) |
58 { |
58 { |
59 return new PredMap(g); |
59 return new PredMap(g); |
78 return new ProcessedMap(); |
78 return new ProcessedMap(); |
79 } |
79 } |
80 |
80 |
81 ///The type of the map that indicates which nodes are reached. |
81 ///The type of the map that indicates which nodes are reached. |
82 |
82 |
83 ///The type of the map that indicates which nodes are reached. |
83 ///The type of the map that indicates which nodes are reached.///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. |
84 ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. |
|
85 typedef typename Digraph::template NodeMap<bool> ReachedMap; |
84 typedef typename Digraph::template NodeMap<bool> ReachedMap; |
86 ///Instantiates a ReachedMap. |
85 ///Instantiates a ReachedMap. |
87 |
86 |
88 ///This function instantiates a ReachedMap. |
87 ///This function instantiates a ReachedMap. |
89 ///\param g is the digraph, to which |
88 ///\param g is the digraph, to which |