X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FGraph.cpp;h=0165bdacc9a4c95d626f21996f83f010c1a52959;hb=9350076b3aa268919a4bf6e05c4a10caebabb913;hp=f78be287b28e15605ffdc3baa41367891f26d5f4;hpb=196d9caeb0b9f74d02750f774de1ca63a483803f;p=features.git

diff --git a/src/Graph.cpp b/src/Graph.cpp
index f78be287b2..0165bdacc9 100644
--- a/src/Graph.cpp
+++ b/src/Graph.cpp
@@ -4,7 +4,7 @@
  * 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.
  */
@@ -45,11 +45,11 @@ bool Graph::bfs_init(int s, bool clear_visited, queue<int> & Q)
 
 
 Graph::EdgePath const
-	Graph::getReachableTo(int target, bool clear_visited)
+	Graph::getReachableTo(int to, bool clear_visited)
 {
 	EdgePath result;
 	queue<int> Q;
-	if (!bfs_init(target, clear_visited, Q))
+	if (!bfs_init(to, clear_visited, Q))
 		return result;
 
 	// Here's the logic, which is shared by the other routines.
@@ -61,7 +61,7 @@ Graph::EdgePath const
 	while (!Q.empty()) {
 		int const current = Q.front();
 		Q.pop();
-		if (current != target || theFormats().get(target).name() != "lyx")
+		if (current != to || theFormats().get(to).name() != "lyx")
 			result.push_back(current);
 
 		vector<Arrow *>::iterator it = vertices_[current].in_arrows.begin();