COIN-OR::LEMON - Graph Library

Changeset 2116:b6a68c15a6a3 in lemon-0.x for doc/graphs.dox


Ignore:
Timestamp:
06/30/06 14:15:45 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2822
Message:

Revert splitted files

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graphs.dox

    r2115 r2116  
    1010provide a node list - edge list interface, i.e. they have
    1111functionalities 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.
     12as  incoming and outgoing edges of a given node.
    1413
    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.
     14Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
     15This concept does not make it possible to change the graph (i.e. it is
     16not possible to add or delete edges or nodes). Most of the graph
     17algorithms will run on these graphs.
    2018
    21 Usually the graphs can be sorted to two group, the first is the
    22 general topology graph types which can store any graph and the second
    23 are the special topology graphs like the \ref FullUGraph or the \ref
    24 GridUGraph.
    2519
     20In case of graphs meeting the full feature
     21\ref lemon::concept::ErasableGraph "ErasableGraph"
     22concept
     23you can also erase individual edges and nodes in arbitrary order.
     24
     25The implemented graph structures are the following.
    2626\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
    2727the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
Note: See TracChangeset for help on using the changeset viewer.