COIN-OR::LEMON - Graph Library

Changeset 650:588ff2ca55bd in lemon-0.x for src/work/marci/bfs_dfs.h


Ignore:
Timestamp:
05/20/04 17:40:59 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@850
Message:

a

File:
1 edited

Legend:

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

    r646 r650  
    2121  /// Bfs searches for the nodes wich are not marked in
    2222  /// \c reached_map
    23   /// Reached have to work as read-write bool Node-map.
     23  /// Reached have to be a read-write bool node-map.
    2424  /// \ingroup galgs
    2525  template <typename Graph, /*typename OutEdgeIt,*/
     
    3737  public:
    3838    /// In that constructor \c _reached have to be a reference
    39     /// for a bool Node-map. The algorithm will search in a bfs order for
    40     /// the nodes which are \c false initially
     39    /// for a bool bode-map. The algorithm will search for the
     40    /// initially \c false nodes
     41    /// in a bfs order.
    4142    BfsIterator(const Graph& _graph, ReachedMap& _reached) :
    4243      graph(&_graph), reached(_reached),
     
    4445    /// The same as above, but the map storing the reached nodes
    4546    /// is constructed dynamically to everywhere false.
     47    /// \deprecated
    4648    BfsIterator(const Graph& _graph) :
    4749      graph(&_graph), reached(*(new ReachedMap(*graph /*, false*/))),
     
    122124    Node bNode() const { return graph->bNode(actual_edge); }
    123125    /// Guess what?
     126    /// \deprecated
    124127    const ReachedMap& getReachedMap() const { return reached; }
    125128    /// Guess what?
     129    /// \deprecated
    126130    const std::queue<Node>& getBfsQueue() const { return bfs_queue; }
    127131  };
     
    130134  /// \c reached_map
    131135  /// Reached have to work as a read-write bool Node-map,
    132   /// Pred is a write Edge Node-map and
    133   /// Dist is a read-write Node-map of integral value, have to be.
     136  /// Pred is a write edge node-map and
     137  /// Dist is a read-write node-map of integral value, have to be.
    134138  /// \ingroup galgs
    135139  template <typename Graph,
     
    180184    }
    181185    /// Guess what?
     186    /// \deprecated
    182187    const PredMap& getPredMap() const { return pred; }
    183188    /// Guess what?
     189    /// \deprecated
    184190    const DistMap& getDistMap() const { return dist; }
    185191  };
     
    204210  public:
    205211    /// In that constructor \c _reached have to be a reference
    206     /// for a bool Node-map. The algorithm will search in a dfs order for
     212    /// for a bool node-map. The algorithm will search in a dfs order for
    207213    /// the nodes which are \c false initially
    208214    DfsIterator(const Graph& _graph, ReachedMap& _reached) :
     
    266272    Node bNode() const { return graph->bNode(actual_edge); }
    267273    /// Guess what?
     274    /// \deprecated
    268275    const ReachedMap& getReachedMap() const { return reached; }
    269276    /// Guess what?
     277    /// \deprecated
    270278    const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }
    271279  };
     
    273281  /// Dfs searches for the nodes wich are not marked in
    274282  /// \c reached_map
    275   /// Reached is a read-write bool Node-map,
    276   /// Pred is a write Node-map, have to be.
     283  /// Reached is a read-write bool node-map,
     284  /// Pred is a write node-map, have to be.
    277285  /// \ingroup galgs
    278286  template <typename Graph,
     
    319327    }
    320328    /// Guess what?
     329    /// \deprecated
    321330    const PredMap& getPredMap() const { return pred; }
    322331  };
Note: See TracChangeset for help on using the changeset viewer.