equal
deleted
inserted
replaced
46 #endif |
46 #endif |
47 class Dfs{ |
47 class Dfs{ |
48 public: |
48 public: |
49 ///The type of the underlying graph. |
49 ///The type of the underlying graph. |
50 typedef GR Graph; |
50 typedef GR Graph; |
51 /// . |
51 ///\e |
52 typedef typename Graph::Node Node; |
52 typedef typename Graph::Node Node; |
53 /// . |
53 ///\e |
54 typedef typename Graph::NodeIt NodeIt; |
54 typedef typename Graph::NodeIt NodeIt; |
55 /// . |
55 ///\e |
56 typedef typename Graph::Edge Edge; |
56 typedef typename Graph::Edge Edge; |
57 /// . |
57 ///\e |
58 typedef typename Graph::OutEdgeIt OutEdgeIt; |
58 typedef typename Graph::OutEdgeIt OutEdgeIt; |
59 |
59 |
60 ///\brief The type of the map that stores the last |
60 ///\brief The type of the map that stores the last |
61 ///edges of the paths on the %DFS tree. |
61 ///edges of the paths on the %DFS tree. |
62 typedef typename Graph::template NodeMap<Edge> PredMap; |
62 typedef typename Graph::template NodeMap<Edge> PredMap; |
105 |
105 |
106 public : |
106 public : |
107 ///Constructor. |
107 ///Constructor. |
108 |
108 |
109 ///\param _G the graph the algorithm will run on. |
109 ///\param _G the graph the algorithm will run on. |
|
110 /// |
110 Dfs(const Graph& _G) : |
111 Dfs(const Graph& _G) : |
111 G(&_G), |
112 G(&_G), |
112 predecessor(NULL), local_predecessor(false), |
113 predecessor(NULL), local_predecessor(false), |
113 pred_node(NULL), local_pred_node(false), |
114 pred_node(NULL), local_pred_node(false), |
114 distance(NULL), local_distance(false) |
115 distance(NULL), local_distance(false) |