#include <list>
#include <queue>
+#include <set>
#include <vector>
typedef std::vector<int> EdgePath;
/// \return a vector of the vertices from which "to" can be reached
EdgePath const getReachableTo(int to, bool clear_visited);
- /// \return a vector of the vertices that can be reached from "from"
- EdgePath const
- getReachable(int from, bool only_viewable, bool clear_visited);
+ /// \return a vector of the reachable vertices, avoiding all "excludes"
+ EdgePath const getReachable(int from, bool only_viewable,
+ bool clear_visited, std::set<int> excludes = std::set<int>());
/// can "from" be reached from "to"?
bool isReachable(int from, int to);
/// find a path from "from" to "to". always returns one of the
private:
///
bool bfs_init(int, bool clear_visited, std::queue<int> & Q);
- /// used to recover a marked path
- void getMarkedPath(int from, int to, EdgePath & path);
/// these represent the arrows connecting the nodes of the graph.
/// this is the basic representation of the graph: as a bunch of
/// arrows.