equal
deleted
inserted
replaced
19 #ifndef LEMON_CONCEPT_GRAPH_H |
19 #ifndef LEMON_CONCEPT_GRAPH_H |
20 #define LEMON_CONCEPT_GRAPH_H |
20 #define LEMON_CONCEPT_GRAPH_H |
21 |
21 |
22 ///\ingroup graph_concepts |
22 ///\ingroup graph_concepts |
23 ///\file |
23 ///\file |
24 ///\brief Declaration of Graph. |
24 ///\brief The concept of Directed Graphs. |
25 |
25 |
26 #include <lemon/bits/invalid.h> |
26 #include <lemon/bits/invalid.h> |
27 #include <lemon/bits/utility.h> |
27 #include <lemon/bits/utility.h> |
28 #include <lemon/concepts/maps.h> |
28 #include <lemon/concepts/maps.h> |
29 #include <lemon/concept_check.h> |
29 #include <lemon/concept_check.h> |
32 namespace lemon { |
32 namespace lemon { |
33 namespace concepts { |
33 namespace concepts { |
34 |
34 |
35 /// \addtogroup graph_concepts |
35 /// \addtogroup graph_concepts |
36 /// @{ |
36 /// @{ |
37 |
37 /// |
38 /// The directed graph concept |
38 /// \brief Class describing the concept of Directed Graphs. |
39 |
39 /// |
40 /// This class describes the \ref concept "concept" of the |
40 /// This class describes the \ref concept "concept" of the |
41 /// immutable directed graphs. |
41 /// immutable directed graphs. |
42 /// |
42 /// |
43 /// Note that actual graph implementation like @ref ListGraph or |
43 /// Note that actual graph implementation like @ref ListGraph or |
44 /// @ref SmartGraph may have several additional functionality. |
44 /// @ref SmartGraph may have several additional functionality. |