79 The \ref StaticDigraph structure is even more optimized for efficiency, |
79 The \ref StaticDigraph structure is even more optimized for efficiency, |
80 but it is completely static. It requires less space in memory and |
80 but it is completely static. It requires less space in memory and |
81 provides faster item iteration than \ref ListDigraph and \ref |
81 provides faster item iteration than \ref ListDigraph and \ref |
82 SmartDigraph, especially using \ref concepts::Digraph::OutArcIt |
82 SmartDigraph, especially using \ref concepts::Digraph::OutArcIt |
83 "OutArcIt" iterators, since its arcs are stored in an appropriate order. |
83 "OutArcIt" iterators, since its arcs are stored in an appropriate order. |
84 However, it only provides \ref StaticDigraph::build() "build()" and |
84 However, you can neither add nor delete arcs or nodes, the graph |
85 \ref \ref StaticDigraph::clear() "clear()" functions and does not |
85 has to be built at once and other modifications are not supported. |
86 support any other modification of the digraph. |
|
87 |
86 |
88 \ref FullDigraph is an efficient implementation of a directed full graph. |
87 \ref FullDigraph is an efficient implementation of a directed full graph. |
89 This structure is also completely static, so you can neither add nor delete |
88 This structure is also completely static and it needs constant space |
90 arcs or nodes, moreover, the class needs constant space in memory. |
89 in memory. |
91 |
90 |
92 |
91 |
93 [SEC]sec_graph_types[SEC] Undirected Graph Structures |
92 [SEC]sec_graph_types[SEC] Undirected Graph Structures |
94 |
93 |
95 The general undirected graph classes, \ref ListGraph and \ref SmartGraph |
94 The general undirected graph classes, \ref ListGraph and \ref SmartGraph |
96 have similar implementations as their directed variants. |
95 have similar implementations as their directed variants. |
97 Therefore, \ref SmartDigraph is more efficient, but \ref ListGraph provides |
96 Therefore, \ref SmartGraph is more efficient, but \ref ListGraph provides |
98 more functionality. |
97 more functionality. |
99 |
|
100 In addition to these general structures, LEMON also provides special purpose |
98 In addition to these general structures, LEMON also provides special purpose |
101 undirected graph types for handling \ref FullGraph "full graphs", |
99 undirected graph types for handling \ref FullGraph "full graphs", |
102 \ref GridGraph "grid graphs" and \ref HypercubeGraph "hypercube graphs". |
100 \ref GridGraph "grid graphs" and \ref HypercubeGraph "hypercube graphs". |
103 They all static structures, i.e. they do not allow distinct item additions |
|
104 or deletions, the graph has to be built at once. |
|
105 |
101 |
106 [TRAILER] |
102 [TRAILER] |
107 */ |
103 */ |
108 } |
104 } |