COIN-OR::LEMON - Graph Library

Changeset 1630:f67737f5727a in lemon-0.x for lemon/concept/graph.h


Ignore:
Timestamp:
08/16/05 18:44:57 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2138
Message:

Doc changes:

  • True and False got documented
  • Graph "developper interface" documentation switched off
  • minor fix in graph_to_eps_demo.cc
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/graph.h

    r1627 r1630  
    428428      Node source(Edge) const { return INVALID; }
    429429
    430       /// Gives back the first Node in the iterating order.
    431      
    432       /// Gives back the first Node in the iterating order.
    433       ///     
     430//       /// Gives back the first Node in the iterating order.
     431     
     432//       /// Gives back the first Node in the iterating order.
     433//       ///     
    434434      void first(Node&) const {}
    435435
    436       /// Gives back the next Node in the iterating order.
    437      
    438       /// Gives back the next Node in the iterating order.
    439       ///     
     436//       /// Gives back the next Node in the iterating order.
     437     
     438//       /// Gives back the next Node in the iterating order.
     439//       ///     
    440440      void next(Node&) const {}
    441441
    442       /// Gives back the first Edge in the iterating order.
    443      
    444       /// Gives back the first Edge in the iterating order.
    445       ///     
     442//       /// Gives back the first Edge in the iterating order.
     443     
     444//       /// Gives back the first Edge in the iterating order.
     445//       ///     
    446446      void first(Edge&) const {}
    447       /// Gives back the next Edge in the iterating order.
    448      
    449       /// Gives back the next Edge in the iterating order.
    450       ///     
     447//       /// Gives back the next Edge in the iterating order.
     448     
     449//       /// Gives back the next Edge in the iterating order.
     450//       ///     
    451451      void next(Edge&) const {}
    452452
    453453
    454       /// Gives back the first of the Edges point to the given Node.
    455      
    456       /// Gives back the first of the Edges point to the given Node.
    457       ///     
     454//       /// Gives back the first of the Edges point to the given Node.
     455     
     456//       /// Gives back the first of the Edges point to the given Node.
     457//       ///     
    458458      void firstIn(Edge&, const Node&) const {}
    459459
    460       /// Gives back the next of the Edges points to the given Node.
    461 
    462 
    463       /// Gives back the next of the Edges points to the given Node.
    464       ///
     460//       /// Gives back the next of the Edges points to the given Node.
     461
     462
     463//       /// Gives back the next of the Edges points to the given Node.
     464//       ///
    465465      void nextIn(Edge&) const {}
    466466
    467       /// Gives back the first of the Edges start from the given Node.
    468      
    469       /// Gives back the first of the Edges start from the given Node.
    470       ///     
     467//       /// Gives back the first of the Edges start from the given Node.
     468     
     469//       /// Gives back the first of the Edges start from the given Node.
     470//       ///     
    471471      void firstOut(Edge&, const Node&) const {}
    472472
    473       /// Gives back the next of the Edges start from the given Node.
    474      
    475       /// Gives back the next of the Edges start from the given Node.
    476       ///     
     473//       /// Gives back the next of the Edges start from the given Node.
     474     
     475//       /// Gives back the next of the Edges start from the given Node.
     476//       ///     
    477477      void nextOut(Edge&) const {}
    478478
     
    512512      /// \warning Making maps that can handle bool type (NodeMap<bool>)
    513513      /// needs some extra attention!
     514      /// \todo Wrong documentation
    514515      template<class T>
    515516      class NodeMap : public ReadWriteMap< Node, T >
     
    535536      /// \warning Making maps that can handle bool type (EdgeMap<bool>)
    536537      /// needs some extra attention!
     538      /// \todo Wrong documentation
    537539      template<class T>
    538540      class EdgeMap : public ReadWriteMap<Edge,T>
Note: See TracChangeset for help on using the changeset viewer.