X-Git-Url: https://main.carlh.net/gitweb/?a=blobdiff_plain;f=libs%2Fardour%2Fardour%2Froute_graph.h;h=aae2ba019db5fc1b8f6b32ed1073f35f8fb61d53;hb=f485cfa324717f57b9f820f43f1b53307b96a8b9;hp=77e74ceafd848f5fe145ceabe470b87330a1219a;hpb=e279b9892b467aa823e253d97b6e9504cca0e252;p=ardour.git

diff --git a/libs/ardour/ardour/route_graph.h b/libs/ardour/ardour/route_graph.h
index 77e74ceafd..aae2ba019d 100644
--- a/libs/ardour/ardour/route_graph.h
+++ b/libs/ardour/ardour/route_graph.h
@@ -41,21 +41,23 @@ class LIBARDOUR_API GraphEdges
 {
 public:
 	typedef std::map<GraphVertex, std::set<GraphVertex> > EdgeMap;
-	
+
 	void add (GraphVertex from, GraphVertex to, bool via_sends_only);
 	bool has (GraphVertex from, GraphVertex to, bool* via_sends_only);
+	bool feeds (GraphVertex from, GraphVertex to);
 	std::set<GraphVertex> from (GraphVertex r) const;
 	void remove (GraphVertex from, GraphVertex to);
 	bool has_none_to (GraphVertex to) const;
 	bool empty () const;
 	void dump () const;
-	
+
 private:
 	void insert (EdgeMap& e, GraphVertex a, GraphVertex b);
-	
+
 	typedef std::multimap<GraphVertex, std::pair<GraphVertex, bool> > EdgeMapWithSends;
-	
+
 	EdgeMapWithSends::iterator find_in_from_to_with_sends (GraphVertex, GraphVertex);
+	EdgeMapWithSends::iterator find_recursively_in_from_to_with_sends (GraphVertex, GraphVertex);
 
 	/** map of edges with from as `first' and to as `second' */
 	EdgeMap _from_to;