equal
deleted
inserted
replaced
68 |
68 |
69 ///The heap type used by Prim algorithm. |
69 ///The heap type used by Prim algorithm. |
70 /// |
70 /// |
71 ///\sa BinHeap |
71 ///\sa BinHeap |
72 ///\sa Prim |
72 ///\sa Prim |
73 typedef BinHeap<typename UGraph::Node, typename CM::Value, |
73 typedef BinHeap<typename CM::Value, |
74 HeapCrossRef, std::less<Value> > Heap; |
74 HeapCrossRef, std::less<Value> > Heap; |
75 |
75 |
76 static Heap *createHeap(HeapCrossRef& _ref){ |
76 static Heap *createHeap(HeapCrossRef& _ref){ |
77 return new Heap(_ref); |
77 return new Heap(_ref); |
78 } |
78 } |