Use the typedef.

git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@37261 a592a061-630c-0410-9148-cb99ea01b6c8
This commit is contained in:
Richard Heck 2011-01-19 14:29:46 +00:00
parent c71040e610
commit 0aee72871b
2 changed files with 6 additions and 6 deletions

View File

@ -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;

View File

@ -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);