One more little comment.

git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@31921 a592a061-630c-0410-9148-cb99ea01b6c8
This commit is contained in:
Richard Heck 2009-11-09 14:03:10 +00:00
parent 66a9bdb291
commit 853199c0ce

View File

@ -52,7 +52,8 @@ vector<int> const
// Q_ holds a list of nodes we have been able to reach (in this // Q_ holds a list of nodes we have been able to reach (in this
// case, reach backwards). It is initailized to the current node // case, reach backwards). It is initailized to the current node
// by bfs_init, and then we recurse, adding the nodes we can reach // by bfs_init, and then we recurse, adding the nodes we can reach
// from the current node as we go. // from the current node as we go. That makes it a breadth-first
// search.
while (!Q_.empty()) { while (!Q_.empty()) {
int const current = Q_.front(); int const current = Q_.front();
Q_.pop(); Q_.pop();