equal
deleted
inserted
replaced
128 |
128 |
129 ///The heap type used by Dijkstra algorithm. |
129 ///The heap type used by Dijkstra algorithm. |
130 /// |
130 /// |
131 ///\sa BinHeap |
131 ///\sa BinHeap |
132 ///\sa Dijkstra |
132 ///\sa Dijkstra |
133 typedef BinHeap<typename Graph::Node, typename LengthMap::Value, |
133 typedef BinHeap<typename LengthMap::Value, |
134 HeapCrossRef, std::less<Value> > Heap; |
134 HeapCrossRef, std::less<Value> > Heap; |
135 |
135 |
136 ///Instantiates a Heap. |
136 ///Instantiates a Heap. |
137 |
137 |
138 ///This function instantiates a \ref Heap. |
138 ///This function instantiates a \ref Heap. |