equal
deleted
inserted
replaced
115 typename Graph::Edge> PredMap; |
115 typename Graph::Edge> PredMap; |
116 |
116 |
117 /// \brief Instantiates a PredMap. |
117 /// \brief Instantiates a PredMap. |
118 /// |
118 /// |
119 /// This function instantiates a \ref PredMap. |
119 /// This function instantiates a \ref PredMap. |
120 /// \param G is the graph, to which we would like to define the PredMap. |
120 /// \param graph is the graph, |
|
121 /// to which we would like to define the PredMap. |
121 /// \todo The graph alone may be insufficient for the initialization |
122 /// \todo The graph alone may be insufficient for the initialization |
122 static PredMap *createPredMap(const _Graph& graph) { |
123 static PredMap *createPredMap(const _Graph& graph) { |
123 return new PredMap(graph); |
124 return new PredMap(graph); |
124 } |
125 } |
125 |
126 |
131 typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap; |
132 typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap; |
132 |
133 |
133 /// \brief Instantiates a DistMap. |
134 /// \brief Instantiates a DistMap. |
134 /// |
135 /// |
135 /// This function instantiates a \ref DistMap. |
136 /// This function instantiates a \ref DistMap. |
136 /// \param G is the graph, to which we would like to define the |
137 /// \param graph is the graph, to which we would like to define the |
137 /// \ref DistMap |
138 /// \ref DistMap |
138 static DistMap *createDistMap(const _Graph& graph) { |
139 static DistMap *createDistMap(const _Graph& graph) { |
139 return new DistMap(graph); |
140 return new DistMap(graph); |
140 } |
141 } |
141 |
142 |
452 /// The algorithm computes |
453 /// The algorithm computes |
453 /// - The shortest path tree for each node. |
454 /// - The shortest path tree for each node. |
454 /// - The distance between each node pairs. |
455 /// - The distance between each node pairs. |
455 /// |
456 /// |
456 /// \note d.run(s) is just a shortcut of the following code. |
457 /// \note d.run(s) is just a shortcut of the following code. |
457 /// \code |
458 ///\code |
458 /// d.init(); |
459 /// d.init(); |
459 /// d.start(); |
460 /// d.start(); |
460 /// \endcode |
461 ///\endcode |
461 void run() { |
462 void run() { |
462 init(); |
463 init(); |
463 start(); |
464 start(); |
464 } |
465 } |
465 |
466 |