COIN-OR::LEMON - Graph Library

Changeset 1188:5ef0ab7b61cd in lemon for lemon/smart_graph.h


Ignore:
Timestamp:
11/14/10 22:48:32 (9 years ago)
Author:
Balazs Dezso <deba@…>
Branch:
default
Phase:
public
Message:

FullBpGraph? implementation (#69)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/smart_graph.h

    r1187 r1188  
    926926    Node blueNode(Edge e) const { return Node(arcs[2 * e._id + 1].target); }
    927927
    928     Node u(Edge e) const { return redNode(e); }
    929     Node v(Edge e) const { return blueNode(e); }
    930 
    931928    static bool direction(Arc a) {
    932929      return (a._id & 1) == 1;
     
    11021099  /// \ingroup graphs
    11031100  ///
    1104   /// \brief A smart undirected graph class.
    1105   ///
    1106   /// \ref SmartBpGraph is a simple and fast graph implementation.
     1101  /// \brief A smart undirected bipartite graph class.
     1102  ///
     1103  /// \ref SmartBpGraph is a simple and fast bipartite graph implementation.
    11071104  /// It is also quite memory efficient but at the price
    11081105  /// that it does not support node and edge deletion
    11091106  /// (except for the Snapshot feature).
    11101107  ///
    1111   /// This type fully conforms to the \ref concepts::Graph "Graph concept"
     1108  /// This type fully conforms to the \ref concepts::BpGraph "BpGraph concept"
    11121109  /// and it also provides some additional functionalities.
    11131110  /// Most of its member functions and nested classes are documented
     
    11161113  /// This class provides constant time counting for nodes, edges and arcs.
    11171114  ///
    1118   /// \sa concepts::Graph
    1119   /// \sa SmartDigraph
     1115  /// \sa concepts::BpGraph
     1116  /// \sa SmartGraph
    11201117  class SmartBpGraph : public ExtendedSmartBpGraphBase {
    11211118    typedef ExtendedSmartBpGraphBase Parent;
Note: See TracChangeset for help on using the changeset viewer.