Changeset 50:72867897fcba in lemon-tutorial for graphs.dox
- Timestamp:
- 02/22/10 13:00:14 (14 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
graphs.dox
r46 r50 82 82 SmartDigraph, especially using \ref concepts::Digraph::OutArcIt 83 83 "OutArcIt" iterators, since its arcs are stored in an appropriate order. 84 However, it only provides \ref StaticDigraph::build() "build()" and 85 \ref \ref StaticDigraph::clear() "clear()" functions and does not 86 support any other modification of the digraph. 84 However, you can neither add nor delete arcs or nodes, the graph 85 has to be built at once and other modifications are not supported. 87 86 88 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 delete90 arcs or nodes, moreover, the class needs constant spacein memory.88 This structure is also completely static and it needs constant space 89 in memory. 91 90 92 91 … … 95 94 The general undirected graph classes, \ref ListGraph and \ref SmartGraph 96 95 have similar implementations as their directed variants. 97 Therefore, \ref Smart Digraph is more efficient, but \ref ListGraph provides96 Therefore, \ref SmartGraph is more efficient, but \ref ListGraph provides 98 97 more functionality. 99 100 98 In addition to these general structures, LEMON also provides special purpose 101 99 undirected graph types for handling \ref FullGraph "full graphs", 102 100 \ref GridGraph "grid graphs" and \ref HypercubeGraph "hypercube graphs". 103 They all static structures, i.e. they do not allow distinct item additions104 or deletions, the graph has to be built at once.105 101 106 102 [TRAILER]
Note: See TracChangeset
for help on using the changeset viewer.