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