COIN-OR::LEMON - Graph Library

Changeset 28:42b0128ae0a7 in lemon-tutorial for basics.dox


Ignore:
Timestamp:
02/15/10 00:36:27 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Add a page about undirected graphs and special graph types

File:
1 edited

Legend:

Unmodified
Added
Removed
  • basics.dox

    r27 r28  
    3333
    3434This 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.
     35for short) in LEMON. Here we use \ref ListDigraph, the most versatile
     36digraph structure. (The library also provides other digraph types,
     37see \ref sec_graph_structures "later".)
    3838
    3939The nodes and the arcs of a graph are identified by two data types called
     
    6363
    6464\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
     66several other operations, see its \ref ListDigraph "documentation" for more
     67information.
    6668However, not all graph structures support the addition and deletion
    67 of graph items.
     69of graph items (see \ref sec_graph_concepts).
    6870
    6971Two important member functions of the directed graphs are
Note: See TracChangeset for help on using the changeset viewer.