X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2FGraph.h;h=2f5de3de36fd6812eee65ed114a771e7ffcf9b33;hb=22e6659780390a19174d1bf896317a5baf9e40d7;hp=305cf70dcf0370ee36c7961b00966950df43c8fa;hpb=c71040e6106563a99bba12bae1a1a0c019a7351a;p=lyx.git diff --git a/src/Graph.h b/src/Graph.h index 305cf70dcf..2f5de3de36 100644 --- a/src/Graph.h +++ b/src/Graph.h @@ -16,6 +16,7 @@ #include #include +#include #include @@ -30,10 +31,10 @@ public: /// typedef std::vector EdgePath; /// \return a vector of the vertices from which "to" can be reached - std::vector const getReachableTo(int to, bool clear_visited); - /// \return a vector of the vertices that can be reached from "from" - std::vector const - getReachable(int from, bool only_viewable, bool clear_visited); + EdgePath const getReachableTo(int to, bool clear_visited); + /// \return a vector of the reachable vertices, avoiding all "excludes" + EdgePath const getReachable(int from, bool only_viewable, + bool clear_visited, std::set excludes = std::set()); /// can "from" be reached from "to"? bool isReachable(int from, int to); /// find a path from "from" to "to". always returns one of the @@ -47,20 +48,18 @@ public: private: /// bool bfs_init(int, bool clear_visited, std::queue & Q); - /// used to recover a marked path - void getMarkedPath(int from, int to, EdgePath & path); /// these represent the arrows connecting the nodes of the graph. - /// this is the basic representation of the graph: as a bunch of + /// this is the basic representation of the graph: as a bunch of /// arrows. struct Arrow { /// - Arrow(int f, int t, int i): + Arrow(int f, int t, int i): from(f), to(t), id(i) {} /// the vertex at the tail of the arrow int from; /// the vertex at the head int to; - /// an id for this arrow, e.g., for use in describing paths + /// an id for this arrow, e.g., for use in describing paths /// through the graph int id; }; @@ -88,7 +87,7 @@ private: /// of Format, this is easy, since the Format objects already have ints /// as identifiers.) std::vector vertices_; - + /// a counter that we use to assign id's to the arrows /// FIXME This technique assumes a correspondence between the /// ids of the arrows and ids associated with Converters that