equal
deleted
inserted
replaced
27 * |
27 * |
28 *Node root() : returns the root |
28 *Node root() : returns the root |
29 * |
29 * |
30 */ |
30 */ |
31 |
31 |
32 #ifndef HUGO_PRIM_H |
32 #ifndef LEMON_PRIM_H |
33 #define HUGO_PRIM_H |
33 #define LEMON_PRIM_H |
34 |
34 |
35 #include <fib_heap.h> |
35 #include <fib_heap.h> |
36 #include <invalid.h> |
36 #include <invalid.h> |
37 |
37 |
38 namespace hugo { |
38 namespace lemon { |
39 |
39 |
40 template <typename Graph, typename T, |
40 template <typename Graph, typename T, |
41 typename Heap=FibHeap<typename Graph::Node, T, |
41 typename Heap=FibHeap<typename Graph::Node, T, |
42 typename Graph::NodeMap<int> >, |
42 typename Graph::NodeMap<int> >, |
43 typename LengthMap=typename Graph::EdgeMap<T> > |
43 typename LengthMap=typename Graph::EdgeMap<T> > |