COIN-OR::LEMON - Graph Library

Changeset 615:b6b31b75b522 in lemon-0.x for src/work/marci/bfs_dfs.h


Ignore:
Timestamp:
05/11/04 21:50:21 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@800
Message:

docs, max_flow improvments

File:
1 edited

Legend:

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

    r604 r615  
    33#define HUGO_BFS_DFS_H
    44
    5 // ///\ingroup gwrappers
    6 ///\file
    7 ///\brief Bfs and dfs iterators.
     5/// \ingroup galgs
     6/// \file
     7/// \brief Bfs and dfs iterators.
    88///
    9 ///This file contains bfs and dfs iterator classes.
     9/// This file contains bfs and dfs iterator classes.
    1010///
    11 // ///\author Marton Makai
     11// /// \author Marton Makai
    1212
    1313#include <queue>
     
    2222  /// \c reached_map
    2323  /// Reached have to work as read-write bool Node-map.
     24  /// \ingroup galgs
    2425  template <typename Graph, /*typename OutEdgeIt,*/
    2526            typename ReachedMap/*=typename Graph::NodeMap<bool>*/ >
     
    106107      return *this;
    107108    }
    108     ///
     109    /// Guess what?
    109110    bool finished() const { return bfs_queue.empty(); }
    110111    /// The conversion operator makes for converting the bfs-iterator
     
    112113    ///\bug Edge have to be in HUGO 0.2
    113114    operator OutEdgeIt() const { return actual_edge; }
    114     ///
     115    /// Guess what?
    115116    bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    116     ///
     117    /// Guess what?
    117118    bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
    118     ///
     119    /// Guess what?
    119120    Node aNode() const { return bfs_queue.front(); }
    120     ///
     121    /// Guess what?
    121122    Node bNode() const { return graph->bNode(actual_edge); }
    122     ///
     123    /// Guess what?
    123124    const ReachedMap& getReachedMap() const { return reached; }
    124     ///
     125    /// Guess what?
    125126    const std::queue<Node>& getBfsQueue() const { return bfs_queue; }
    126   }; 
     127  };
    127128
    128129  /// Bfs searches for the nodes wich are not marked in
     
    130131  /// Reached have to work as a read-write bool Node-map,
    131132  /// Pred is a write Edge Node-map and
    132   /// Dist is a read-write int Node-map, have to be.
    133   ///\todo In fact onsly simple operations requirement are needed for
    134   /// Dist::Value.
     133  /// Dist is a read-write Node-map of integral value, have to be.
     134  /// \ingroup galgs
    135135  template <typename Graph,
    136136            typename ReachedMap=typename Graph::template NodeMap<bool>,
     
    179179      return *this;
    180180    }
    181     ///
     181    /// Guess what?
    182182    const PredMap& getPredMap() const { return pred; }
    183     ///
     183    /// Guess what?
    184184    const DistMap& getDistMap() const { return dist; }
    185185  };
     
    188188  /// \c reached_map
    189189  /// Reached have to be a read-write bool Node-map.
     190  /// \ingroup galgs
    190191  template <typename Graph, /*typename OutEdgeIt,*/
    191192            typename ReachedMap/*=typename Graph::NodeMap<bool>*/ >
     
    249250      return *this;
    250251    }
    251     ///
     252    /// Guess what?
    252253    bool finished() const { return dfs_stack.empty(); }
    253     ///
     254    /// Guess what?
    254255    operator OutEdgeIt() const { return actual_edge; }
    255     ///
     256    /// Guess what?
    256257    bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    257     ///
     258    /// Guess what?
    258259    bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
    259     ///
     260    /// Guess what?
    260261    Node aNode() const { return actual_node; /*FIXME*/}
    261     ///
     262    /// Guess what?
    262263    Node bNode() const { return graph->bNode(actual_edge); }
    263     ///
     264    /// Guess what?
    264265    const ReachedMap& getReachedMap() const { return reached; }
    265     ///
     266    /// Guess what?
    266267    const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }
    267268  };
     
    271272  /// Reached is a read-write bool Node-map,
    272273  /// Pred is a write Node-map, have to be.
     274  /// \ingroup galgs
    273275  template <typename Graph,
    274276            typename ReachedMap=typename Graph::template NodeMap<bool>,
     
    313315      return *this;
    314316    }
    315     ///
     317    /// Guess what?
    316318    const PredMap& getPredMap() const { return pred; }
    317319  };
Note: See TracChangeset for help on using the changeset viewer.