Changeset 2116:b6a68c15a6a3 in lemon0.x for doc/graphs.dox
 Timestamp:
 06/30/06 14:15:45 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2822
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/graphs.dox
r2115 r2116 10 10 provide a node list  edge list interface, i.e. they have 11 11 functionalities to list the nodes and the edges of the graph as well 12 as incoming and outgoing edges of a given node. This functionalities 13 are defined in the \ref lemon::concept::Graph "Graph" concept. 12 as incoming and outgoing edges of a given node. 14 13 15 The next important graph type concept is the undirected graph concept 16 what is defined in the \ref lemon::concept::UGraph "UGraph" concept class. 17 Each undirected graphs provide node  undirected edge list interfaces. 18 In addition the undirected graphs can be used as directed graphs so 19 they are also conform to the \ref lemon::concept::Graph "Graph" concept. 14 Each graph should meet the \ref lemon::concept::Graph "Graph" concept. 15 This concept does not make it possible to change the graph (i.e. it is 16 not possible to add or delete edges or nodes). Most of the graph 17 algorithms will run on these graphs. 20 18 21 Usually the graphs can be sorted to two group, the first is the22 general topology graph types which can store any graph and the second23 are the special topology graphs like the \ref FullUGraph or the \ref24 GridUGraph.25 19 20 In case of graphs meeting the full feature 21 \ref lemon::concept::ErasableGraph "ErasableGraph" 22 concept 23 you can also erase individual edges and nodes in arbitrary order. 24 25 The implemented graph structures are the following. 26 26 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets 27 27 the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
Note: See TracChangeset
for help on using the changeset viewer.