COIN-OR::LEMON - Graph Library

Changeset 32:ef12f83752f6 in lemon-tutorial for graphs.dox


Ignore:
Timestamp:
02/15/10 01:51:58 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Happy New Year + unify files

File:
1 edited

Legend:

Unmodified
Added
Removed
  • graphs.dox

    r28 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    3939In LEMON, there are various graph types, which are rather different, but
    4040they all conform to the corresponding \ref graph_concepts "graph concept",
    41 which defines the common part of the graph interfaces. 
     41which defines the common part of the graph interfaces.
    4242The \ref concepts::Digraph "Digraph concept" describes the common interface
    4343of directed graphs (without any sensible implementation), while
     
    5151along with some useful basic functions for obtaining the identifiers of
    5252the items, the end nodes of the arcs (or edges) and their iterators,
    53 etc. 
     53etc.
    5454An actual graph implementation may have various additional functionalities
    5555according to its purpose.
     
    6767significantly more efficient (both in terms of space and time), but it
    6868provides less functionality. For example, nodes and arcs cannot be
    69 removed from it. 
     69removed from it.
    7070
    7171\ref FullDigraph is an efficient implementation of a directed full graph.
     
    8282
    8383The \ref concepts::Graph "undirected graphs" also fulfill the concept of
    84 \ref concepts::Digraph "directed graphs", in such a way that each 
     84\ref concepts::Digraph "directed graphs", in such a way that each
    8585undirected \e edge of a graph can also be regarded as two oppositely
    8686directed \e arcs. As a result, all directed graph algorithms automatically
     
    9999\code
    100100  ListGraph g;
    101  
     101
    102102  ListGraph::Node a = g.addNode();
    103103  ListGraph::Node b = g.addNode();
     
    134134  std::cout << "Edge " << g.id(e) << " connects node "
    135135    << g.id(g.u(e)) << " and node " << g.id(g.v(e)) << std::endl;
    136  
     136
    137137  std::cout << "Arc " << g.id(a2) << " goes from node "
    138138    << g.id(g.source(a2)) << " to node " << g.id(g.target(a2)) << std::endl;
     
    184184  std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl;
    185185\endcode
    186  
     186
    187187[SEC]sec_special_graphs[SEC] Special Graph Structures
    188188
Note: See TracChangeset for help on using the changeset viewer.