* Licence details can be found in the file COPYING.
*
* \author Dekel Tsur (original code)
- * \author Richard Heck (re-implementation)
+ * \author Richard Kimberly Heck (re-implementation)
*
* Full author contact details are available in file CREDITS.
*/
#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
///
bool bfs_init(int, bool clear_visited, std::queue<int> & Q);
/// these represent the arrows connecting the nodes of the graph.
- /// this is the basic representation of the graph: as a bunch of
+ /// this is the basic representation of the graph: as a bunch of
/// arrows.
struct Arrow {
///
- Arrow(int f, int t, int i):
+ Arrow(int f, int t, int i):
from(f), to(t), id(i) {}
/// the vertex at the tail of the arrow
int from;
/// the vertex at the head
int to;
- /// an id for this arrow, e.g., for use in describing paths
+ /// an id for this arrow, e.g., for use in describing paths
/// through the graph
int id;
};
/// of Format, this is easy, since the Format objects already have ints
/// as identifiers.)
std::vector<Vertex> vertices_;
-
+
/// a counter that we use to assign id's to the arrows
/// FIXME This technique assumes a correspondence between the
/// ids of the arrows and ids associated with Converters that