equal
deleted
inserted
replaced
28 ///A list graph class. |
28 ///A list graph class. |
29 |
29 |
30 ///This is a simple and fast erasable graph implementation. |
30 ///This is a simple and fast erasable graph implementation. |
31 /// |
31 /// |
32 ///It conforms to the graph interface documented under |
32 ///It conforms to the graph interface documented under |
33 ///the description of \ref ErasableGraphSkeleton. |
33 ///the description of |
34 ///\sa \ref ErasableGraphSkeleton. |
34 ///\ref skeleton::ErasableGraphSkeleton "ErasableGraphSkeleton". |
|
35 ///\sa skeleton::ErasableGraphSkeleton. |
35 class ListGraph { |
36 class ListGraph { |
36 |
37 |
37 //Nodes are double linked. |
38 //Nodes are double linked. |
38 //The free nodes are only single linked using the "next" field. |
39 //The free nodes are only single linked using the "next" field. |
39 struct NodeT |
40 struct NodeT |
75 class InEdgeIt; |
76 class InEdgeIt; |
76 |
77 |
77 /// Creating map registries. |
78 /// Creating map registries. |
78 CREATE_MAP_REGISTRIES; |
79 CREATE_MAP_REGISTRIES; |
79 /// Creating node and edge maps. |
80 /// Creating node and edge maps. |
|
81 |
|
82 /// \todo |
|
83 /// It apears in the documentation as if it were a function definition. |
80 CREATE_MAPS(DefaultMap); |
84 CREATE_MAPS(DefaultMap); |
81 |
85 |
82 public: |
86 public: |
83 |
87 |
84 ListGraph() |
88 ListGraph() |