equal
deleted
inserted
replaced
25 ///A full graph class. |
25 ///A full graph class. |
26 |
26 |
27 ///This is a simple and fast directed full graph implementation. |
27 ///This is a simple and fast directed full graph implementation. |
28 ///It is completely static, so you can neither add nor delete either |
28 ///It is completely static, so you can neither add nor delete either |
29 ///edges or nodes. |
29 ///edges or nodes. |
30 ///Otherwise it conforms to the graph interface documented under |
30 ///Thus it conforms to |
31 ///the description of \ref GraphSkeleton. |
31 ///the \ref skeleton::StaticGraph "StaticGraph" concept |
32 ///\sa \ref GraphSkeleton. |
32 ///\sa skeleton::StaticGraph. |
33 ///\todo What about loops? |
33 ///\todo What about loops? |
34 ///\todo Don't we need SymEdgeMap? |
34 ///\todo Don't we need SymEdgeMap? |
35 /// |
35 /// |
36 ///\author Alpar Juttner |
36 ///\author Alpar Juttner |
37 class FullGraph { |
37 class FullGraph { |