equal
deleted
inserted
replaced
1 // -*- c++ -*- |
1 // -*- c++ -*- |
2 #ifndef HUGO_GRAPH_H |
2 #ifndef LEMON_GRAPH_H |
3 #define HUGO_GRAPH_H |
3 #define LEMON_GRAPH_H |
4 |
4 |
5 ///\file |
5 ///\file |
6 ///\brief Declaration of GraphConcept. |
6 ///\brief Declaration of GraphConcept. |
7 |
7 |
8 #include <hugo/invalid.h> |
8 #include <lemon/invalid.h> |
9 |
9 |
10 namespace hugo { |
10 namespace lemon { |
11 |
11 |
12 /// @defgroup empty_graph The GraphConcept class |
12 /// @defgroup empty_graph The GraphConcept class |
13 /// @{ |
13 /// @{ |
14 |
14 |
15 /// An empty graph class. |
15 /// An empty graph class. |
469 using InEdgeIterableGraphConcept::next; |
469 using InEdgeIterableGraphConcept::next; |
470 }; |
470 }; |
471 |
471 |
472 /// @} |
472 /// @} |
473 |
473 |
474 } //namespace hugo |
474 } //namespace lemon |
475 |
475 |
476 |
476 |
477 |
477 |
478 // class EmptyBipGraph : public Graph Concept |
478 // class EmptyBipGraph : public Graph Concept |
479 // { |
479 // { |
489 // enum NodeClass { A = 0, B = 1 }; |
489 // enum NodeClass { A = 0, B = 1 }; |
490 // NodeClass getClass(Node n) {} |
490 // NodeClass getClass(Node n) {} |
491 |
491 |
492 // } |
492 // } |
493 |
493 |
494 #endif // HUGO_GRAPH_H |
494 #endif // LEMON_GRAPH_H |