Changeset 28:42b0128ae0a7 in lemon-tutorial for basics.dox
- Timestamp:
- 02/15/10 00:36:27 (14 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
basics.dox
r27 r28 33 33 34 34 This section tells you how to work with a directed graph (\e digraph, 35 for short) in LEMON. 36 The library provides various digraph structures for both general and special 37 purposes. Here we use \c ListDigraph, the most versatile digraph type. 35 for short) in LEMON. Here we use \ref ListDigraph, the most versatile 36 digraph structure. (The library also provides other digraph types, 37 see \ref sec_graph_structures "later".) 38 38 39 39 The nodes and the arcs of a graph are identified by two data types called … … 63 63 64 64 \note Using ListDigraph, you can also remove nodes or arcs with the 65 \ref ListDigraph::erase() "erase()" function. 65 \ref ListDigraph::erase() "erase()" function. Moreover, this class provides 66 several other operations, see its \ref ListDigraph "documentation" for more 67 information. 66 68 However, not all graph structures support the addition and deletion 67 of graph items .69 of graph items (see \ref sec_graph_concepts). 68 70 69 71 Two important member functions of the directed graphs are
Note: See TracChangeset
for help on using the changeset viewer.