X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FGraph.h;h=50d8bf855da73919e7ac67a5f3bdfc77f6ad2ee3;hb=a9409b47851e57afb2a9c1b1262e60c6963d9dc4;hp=1518677b3958e957d5752f7385178f98e81ba923;hpb=1d255a8da557167caaa471a40d5d91b3426906e5;p=lyx.git

diff --git a/src/Graph.h b/src/Graph.h
index 1518677b39..50d8bf855d 100644
--- a/src/Graph.h
+++ b/src/Graph.h
@@ -16,6 +16,7 @@
 
 #include <list>
 #include <queue>
+#include <set>
 #include <vector>
 
 
@@ -33,7 +34,7 @@ public:
 	EdgePath const getReachableTo(int to, 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::vector<int> excludes = std::vector<int>());
+		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