Use the typedef.

git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@37261 a592a061-630c-0410-9148-cb99ea01b6c8

diff --git a/src/Graph.cpp b/src/Graph.cpp
index 09db31e5f24e4d62c784e515076bf1c13ab0a632..d7ea066dc36e6daa7bc76fa5a2de54d9b8cfe51c 100644 (file)
--- 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 305cf70dcf0370ee36c7961b00966950df43c8fa..3ccc8a70752db090c22f3b7137a54f6d1938ff7d 100644 (file)
--- 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);