equal
deleted
inserted
replaced
25 ///A list graph class. |
25 ///A list graph class. |
26 |
26 |
27 ///This is a simple and fast erasable graph implementation. |
27 ///This is a simple and fast erasable graph implementation. |
28 /// |
28 /// |
29 ///It conforms to the graph interface documented under |
29 ///It conforms to the graph interface documented under |
30 ///the description of \ref GraphSkeleton. |
30 ///the description of \ref Graph. |
31 ///\sa \ref GraphSkeleton. |
31 ///\sa \ref Graph. |
32 class ListGraph { |
32 class ListGraph { |
33 |
33 |
34 //Nodes are double linked. |
34 //Nodes are double linked. |
35 //The free nodes are only single linked using the "next" field. |
35 //The free nodes are only single linked using the "next" field. |
36 struct NodeT |
36 struct NodeT |
380 ///There is a new edge map type called |
380 ///There is a new edge map type called |
381 ///\ref SymListGraph::SymEdgeMap "SymEdgeMap" |
381 ///\ref SymListGraph::SymEdgeMap "SymEdgeMap" |
382 ///that complements this |
382 ///that complements this |
383 ///feature by |
383 ///feature by |
384 ///storing shared values for the edge pairs. The usual |
384 ///storing shared values for the edge pairs. The usual |
385 ///\ref GraphSkeleton::EdgeMap "EdgeMap" |
385 ///\ref Graph::EdgeMap "EdgeMap" |
386 ///can be used |
386 ///can be used |
387 ///as well. |
387 ///as well. |
388 /// |
388 /// |
389 ///The oppositely directed edge can also be obtained easily |
389 ///The oppositely directed edge can also be obtained easily |
390 ///using \ref opposite. |
390 ///using \ref opposite. |