equal
deleted
inserted
replaced
71 |
71 |
72 ///The heap type used by Dijkstra algorithm. |
72 ///The heap type used by Dijkstra algorithm. |
73 /// |
73 /// |
74 ///\sa BinHeap |
74 ///\sa BinHeap |
75 ///\sa Dijkstra |
75 ///\sa Dijkstra |
76 typedef BinHeap<typename Graph::Node, typename LM::Value, |
76 typedef BinHeap<typename LM::Value, HeapCrossRef, std::less<Value> > Heap; |
77 HeapCrossRef, std::less<Value> > Heap; |
|
78 |
77 |
79 static Heap *createHeap(HeapCrossRef& R) |
78 static Heap *createHeap(HeapCrossRef& R) |
80 { |
79 { |
81 return new Heap(R); |
80 return new Heap(R); |
82 } |
81 } |
845 |
844 |
846 ///The heap type used by Dijkstra algorithm. |
845 ///The heap type used by Dijkstra algorithm. |
847 /// |
846 /// |
848 ///\sa BinHeap |
847 ///\sa BinHeap |
849 ///\sa Dijkstra |
848 ///\sa Dijkstra |
850 typedef BinHeap<typename Graph::Node, typename LM::Value, |
849 typedef BinHeap<typename LM::Value, typename GR::template NodeMap<int>, |
851 typename GR::template NodeMap<int>, |
|
852 std::less<Value> > Heap; |
850 std::less<Value> > Heap; |
853 |
851 |
854 static Heap *createHeap(HeapCrossRef& R) |
852 static Heap *createHeap(HeapCrossRef& R) |
855 { |
853 { |
856 return new Heap(R); |
854 return new Heap(R); |