COIN-OR::LEMON - Graph Library

Changeset 2256:b22dfb6c5ff3 in lemon-0.x


Ignore:
Timestamp:
10/20/06 14:05:54 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3008
Message:

Graph imlementations actually provide ReferenceMaps?.

Location:
lemon
Files:
4 edited

Legend:

Unmodified
Added
Removed
  • lemon/full_graph.h

    r2231 r2256  
    168168  /// edges or nodes.
    169169  /// Thus it conforms to
    170   /// the \ref concept::Graph "Graph" concept
     170  /// the \ref concept::Graph "Graph" concept and
     171  ///it also has an
     172  ///important extra feature that
     173  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    171174  /// \sa concept::Graph.
    172175  ///
     
    379382  /// is that this class conforms to the undirected graph concept and
    380383  /// it does not contain the loop edges.
     384  ///
     385  ///It also has an
     386  ///important extra feature that
     387  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    381388  ///
    382389  /// \sa FullGraph
  • lemon/grid_ugraph.h

    r2223 r2256  
    294294  ///
    295295  /// The graph type is fully conform to the \ref concept::UGraph
    296   /// "Undirected Graph" concept.
     296  /// "Undirected Graph" concept,  and it also has an
     297  ///important extra feature that
     298  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     299  ///
    297300  ///
    298301  /// \author Balazs Dezso
  • lemon/list_graph.h

    r2231 r2256  
    323323  ///The most of the member functions and nested classes are
    324324  ///documented only in the concept class.
     325  ///
     326  ///An important extra feature of this graph implementation is that
     327  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     328  ///
    325329  ///\sa concept::Graph.
    326330
     
    744748  ///This is a simple and fast undirected graph implementation.
    745749  ///
     750  ///An important extra feature of this graph implementation is that
     751  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     752  ///
    746753  ///It conforms to the
    747754  ///\ref concept::UGraph "UGraph concept".
     
    14921499  /// This is a bipartite undirected graph implementation.
    14931500  /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
     1501  ///
     1502  ///An important extra feature of this graph implementation is that
     1503  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     1504  ///
    14941505  /// \sa concept::BpUGraph.
    14951506  ///
  • lemon/smart_graph.h

    r2231 r2256  
    195195  ///node and edge deletions</b>.
    196196  ///It conforms to
    197   ///the \ref concept::Graph "Graph concept".
     197  ///the \ref concept::Graph "Graph concept" with an
     198  ///important extra feature that
     199  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     200  ///
    198201  ///\sa concept::Graph.
    199202  ///
     
    379382  /// Except from this it conforms to
    380383  /// the \ref concept::UGraph "UGraph concept".
     384  ///
     385  ///It also has an
     386  ///important extra feature that
     387  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     388  ///
    381389  /// \sa concept::UGraph.
    382390  ///
     
    756764  /// Except from this it conforms to
    757765  /// the \ref concept::BpUGraph "BpUGraph concept".
     766  ///
     767  ///It also has an
     768  ///important extra feature that
     769  ///its maps are real \ref concept::ReferenceMap "reference map"s.
     770  ///
    758771  /// \sa concept::BpUGraph.
    759772  ///
Note: See TracChangeset for help on using the changeset viewer.