COIN-OR::LEMON - Graph Library

Changeset 2476:059dcdda37c5 in lemon-0.x for doc/basic_concepts.dox


Ignore:
Timestamp:
09/27/07 15:04:06 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3315
Message:

Bug fixes in the documentation (mainly bad references).

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/basic_concepts.dox

    r2391 r2476  
    3030have to satisfy one or more \ref concept "graph concepts" which are standardized
    3131interfaces to work with the rest of the library. The most basic concept is the
    32 \ref Graph.<br>
     32\ref concepts::Graph "Graph".<br>
    3333A good example is the \ref ListGraph which we already know from Hello World and
    3434will be used in our examples as well.
     
    4848to the graph with the addNode() member function. It returns the newly added node
    4949(as value). So if you need the new node to do something useful with, for example
    50 create an edge, assign a value to it through \ref map1 maps.
     50create an edge, assign a value to it through \ref maps1 maps.
    5151\code lemon::ListGraph::Node  new_node = graph.addNode(); \endcode
    5252
     
    115115the next page.)
    116116
    117 The \ref EdgeIt works exactly the same - nothing more to say. But there are \ref InEdgeIt
    118 and \ref OutEdgeIt by directed graphs and \ref IncEdgeIt by undirected graphs.
     117The \ref concepts::Graph::EdgeIt "EdgeIt" works exactly the same - nothing more to say.
     118But there are \ref concepts::Graph::InEdgeIt "InEdgeIt" and
     119\ref concepts::Graph::OutEdgeIt "OutEdgeIt" by directed graphs and
     120\ref concepts::UGraph::IncEdgeIt "IncEdgeIt" by undirected graphs.
    119121They take two arguments. The first is a graph, the second is certain node of the
    120122graph. InEdgeIt iterates on the incoming edges of that node and OutEdgeIt does it
Note: See TracChangeset for help on using the changeset viewer.