* sk.po

[lyx.git] / src / Graph.h

diff --git a/src/Graph.h b/src/Graph.h
index e999f39a338a81c011aaab6917e4e514674d31b6..239cbcb90a095de706785ccc7e6a95e5597fe746 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);
@@ -46,9 +46,7 @@ public:
 
 private:
        ///
-       bool bfs_init(int, bool clear_visited, std::queue<int>* Q);
-       /// used to recover a marked path 
-       void getMarkedPath(int from, int to, EdgePath & path);
+       bool bfs_init(int, bool clear_visited, std::queue<int> & Q);
        /// these represent the arrows connecting the nodes of the graph.
        /// this is the basic representation of the graph: as a bunch of 
        /// arrows.