COIN-OR::LEMON - Graph Library

Changeset 802:bc0c74eeb151 in lemon-0.x for src/hugo/dfs.h


Ignore:
Timestamp:
09/05/04 22:11:47 (20 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1096
Message:
  • Changes in doc
  • setGraph(...) finally removed from Dijkstra, Bfs and Dfs.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/dfs.h

    r781 r802  
    3434    ///The type of the underlying graph.
    3535    typedef GR Graph;
     36    /// .
    3637    typedef typename Graph::Node Node;
     38    /// .
    3739    typedef typename Graph::NodeIt NodeIt;
     40    /// .
    3841    typedef typename Graph::Edge Edge;
     42    /// .
    3943    typedef typename Graph::OutEdgeIt OutEdgeIt;
    4044   
     
    4953
    5054  private:
     55    /// Pointer to the underlying graph.
    5156    const Graph *G;
     57    ///Pointer to the map of predecessors edges.
    5258    PredMap *predecessor;
     59    ///Indicates if \ref predecessor is locally allocated (\c true) or not.
    5360    bool local_predecessor;
     61    ///Pointer to the map of predecessors nodes.
    5462    PredNodeMap *pred_node;
     63    ///Indicates if \ref pred_node is locally allocated (\c true) or not.
    5564    bool local_pred_node;
     65    ///Pointer to the map of distances.
    5666    DistMap *distance;
     67    ///Indicates if \ref distance is locally allocated (\c true) or not.
    5768    bool local_distance;
    5869
    59     //The source node of the last execution.
     70    ///The source node of the last execution.
    6071    Node source;
    6172
     
    7990   
    8091  public :   
     92    ///Constructor.
     93   
     94    ///\param _G the graph the algorithm will run on.
    8195    Dfs(const Graph& _G) :
    8296      G(&_G),
     
    86100    { }
    87101   
     102    ///Destructor.
    88103    ~Dfs()
    89104    {
     
    93108    }
    94109
    95     ///Sets the graph the algorithm will run on.
    96 
    97     ///Sets the graph the algorithm will run on.
    98     ///\return <tt> (*this) </tt>
    99     ///\bug What about maps?
    100     ///\todo It may be unnecessary
    101     Dfs &setGraph(const Graph &_G)
    102     {
    103       G = &_G;
    104       return *this;
    105     }
    106110    ///Sets the map storing the predecessor edges.
    107111
     
    254258
    255259    ///Returns \c true if \c v is reachable from the root.
    256     ///\warning The root node is reported to be reached!
     260    ///\note The root node is reported to be reached!
    257261    ///
    258262    ///\pre \ref run() must be called before using this function.
Note: See TracChangeset for help on using the changeset viewer.