X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FGraph.h;h=50d8bf855da73919e7ac67a5f3bdfc77f6ad2ee3;hb=a48581f48c93b3981ffd3e058f57e3ed95b53641;hp=3ccc8a70752db090c22f3b7137a54f6d1938ff7d;hpb=0aee72871bb75643ab1e599519ef2f1454fd84e9;p=lyx.git

diff --git a/src/Graph.h b/src/Graph.h
index 3ccc8a7075..50d8bf855d 100644
--- a/src/Graph.h
+++ b/src/Graph.h
@@ -16,6 +16,7 @@
 
 #include <list>
 #include <queue>
+#include <set>
 #include <vector>
 
 
@@ -31,9 +32,9 @@ public:
 	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
@@ -47,8 +48,6 @@ public:
 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.