COIN-OR::LEMON - Graph Library

Changeset 646:bd7a69231cf8 in lemon-0.x for src/work/marci/bfs_dfs.h


Ignore:
Timestamp:
05/19/04 18:06:57 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@846
Message:

max_flow.h: status flags for actMinCut
leda_graph_wrapper.h: NodeMapWrapper?, EdgeMapWrapper?

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/bfs_dfs.h

    r615 r646  
    107107      return *this;
    108108    }
    109     /// Guess what?
     109    /// Returns true iff the algorithm is finished.
    110110    bool finished() const { return bfs_queue.empty(); }
    111111    /// The conversion operator makes for converting the bfs-iterator
     
    113113    ///\bug Edge have to be in HUGO 0.2
    114114    operator OutEdgeIt() const { return actual_edge; }
    115     /// Guess what?
     115    /// Returns if b-node has been reached just now.
    116116    bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    117     /// Guess what?
     117    /// Returns if a-node is examined.
    118118    bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
    119     /// Guess what?
     119    /// Returns a-node of the actual edge, so does if the edge is invalid.
    120120    Node aNode() const { return bfs_queue.front(); }
    121     /// Guess what?
     121    /// \pre The actual edge have to be valid.
    122122    Node bNode() const { return graph->bNode(actual_edge); }
    123123    /// Guess what?
     
    250250      return *this;
    251251    }
    252     /// Guess what?
     252    /// Returns true iff the algorithm is finished.
    253253    bool finished() const { return dfs_stack.empty(); }
    254     /// Guess what?
     254    /// The conversion operator makes for converting the bfs-iterator
     255    /// to an \c out-edge-iterator.
     256    ///\bug Edge have to be in HUGO 0.2
    255257    operator OutEdgeIt() const { return actual_edge; }
    256     /// Guess what?
     258    /// Returns if b-node has been reached just now.
    257259    bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    258     /// Guess what?
     260    /// Returns if a-node is examined.
    259261    bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
    260     /// Guess what?
     262    /// Returns a-node of the actual edge, so does if the edge is invalid.
    261263    Node aNode() const { return actual_node; /*FIXME*/}
    262     /// Guess what?
     264    /// Returns b-node of the actual edge.
     265    /// \pre The actual edge have to be valid.
    263266    Node bNode() const { return graph->bNode(actual_edge); }
    264267    /// Guess what?
Note: See TracChangeset for help on using the changeset viewer.