equal
deleted
inserted
replaced
23 ///It is completely static, so you can neither add nor delete either |
23 ///It is completely static, so you can neither add nor delete either |
24 ///edges or nodes. |
24 ///edges or nodes. |
25 ///Otherwise it conforms to the graph interface documented under |
25 ///Otherwise it conforms to the graph interface documented under |
26 ///the description of \ref GraphSkeleton. |
26 ///the description of \ref GraphSkeleton. |
27 ///\sa \ref GraphSkeleton. |
27 ///\sa \ref GraphSkeleton. |
28 ///\todo Shouldn't we avoid loops? |
28 ///\todo What about loops? |
|
29 ///\todo Don't we need SymEdgeMap? |
29 /// |
30 /// |
30 ///\author Alpar Juttner |
31 ///\author Alpar Juttner |
31 class FullGraph { |
32 class FullGraph { |
32 int NodeNum; |
33 int NodeNum; |
33 int EdgeNum; |
34 int EdgeNum; |