diff --git a/src/Graph.cpp b/src/Graph.cpp
index 09db31e5f2..d7ea066dc3 100644
--- a/src/Graph.cpp
+++ b/src/Graph.cpp
@@ -46,10 +46,10 @@ bool Graph::bfs_init(int s, bool clear_visited, queue<int> & Q)
 }
 
 
-vector<int> const
+Graph::EdgePath const
 	Graph::getReachableTo(int target, bool clear_visited)
 {
-	vector<int> result;
+	EdgePath result;
 	queue<int> Q;
 	if (!bfs_init(target, clear_visited, Q))
 		return result;
@@ -81,11 +81,11 @@ vector<int> const
 }
 
 
-vector<int> const
+Graph::EdgePath const
 	Graph::getReachable(int from, bool only_viewable,
 		bool clear_visited)
 {
-	vector<int> result;
+	EdgePath result;
 	queue<int> Q;
 	if (!bfs_init(from, clear_visited, Q))
 		return result;
diff --git a/src/Graph.h b/src/Graph.h
index 305cf70dcf..3ccc8a7075 100644
--- a/src/Graph.h
+++ b/src/Graph.h
@@ -30,9 +30,9 @@ public:
 	///
 	typedef std::vector<int> EdgePath;
 	/// \return a vector of the vertices from which "to" can be reached
-	std::vector<int> const getReachableTo(int to, bool clear_visited);
+	EdgePath const getReachableTo(int to, bool clear_visited);
 	/// \return a vector of the vertices that can be reached from "from"
-	std::vector<int> const
+	EdgePath const
 		getReachable(int from, bool only_viewable, bool clear_visited);
 	/// can "from" be reached from "to"?
 	bool isReachable(int from, int to);