equal
deleted
inserted
replaced
519 /// The heap type used by weighted matching algorithms. It should |
519 /// The heap type used by weighted matching algorithms. It should |
520 /// minimize the priorities and the heap's key type is the graph's |
520 /// minimize the priorities and the heap's key type is the graph's |
521 /// anode graph's node. |
521 /// anode graph's node. |
522 /// |
522 /// |
523 /// \sa BinHeap |
523 /// \sa BinHeap |
524 typedef BinHeap<typename BpUGraph::Node, Value, HeapCrossRef> Heap; |
524 typedef BinHeap<Value, HeapCrossRef> Heap; |
525 |
525 |
526 /// \brief Instantiates a Heap. |
526 /// \brief Instantiates a Heap. |
527 /// |
527 /// |
528 /// This function instantiates a \ref Heap. |
528 /// This function instantiates a \ref Heap. |
529 /// \param crossref The cross reference of the heap. |
529 /// \param crossref The cross reference of the heap. |