equal
deleted
inserted
replaced
1092 /// The heap type used by costed matching algorithms. It should |
1092 /// The heap type used by costed matching algorithms. It should |
1093 /// minimize the priorities and the heap's key type is the graph's |
1093 /// minimize the priorities and the heap's key type is the graph's |
1094 /// anode graph's node. |
1094 /// anode graph's node. |
1095 /// |
1095 /// |
1096 /// \sa BinHeap |
1096 /// \sa BinHeap |
1097 typedef BinHeap<typename BpUGraph::Node, Value, HeapCrossRef> Heap; |
1097 typedef BinHeap<Value, HeapCrossRef> Heap; |
1098 |
1098 |
1099 /// \brief Instantiates a Heap. |
1099 /// \brief Instantiates a Heap. |
1100 /// |
1100 /// |
1101 /// This function instantiates a \ref Heap. |
1101 /// This function instantiates a \ref Heap. |
1102 /// \param crossref The cross reference of the heap. |
1102 /// \param crossref The cross reference of the heap. |