graph_edges.h

Go to the documentation of this file.

/*
 * Copyright (C) 2015-2022 Robin Gareus <robin@gareus.org>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */
 
#ifndef __ardour_route_graph_h__
#define __ardour_route_graph_h__
 
#include <map>
#include <set>
 
#include "ardour/libardour_visibility.h"
#include "ardour/types.h"
 
namespace ARDOUR {
class GraphNode;
 
typedef std::shared_ptr<GraphNode> GraphVertex;
 
class LIBARDOUR_API GraphEdges
{
public:
        void add (GraphVertex from, GraphVertex to, bool via_sends_only);
        void remove (GraphVertex from, GraphVertex to);
 
        bool has (GraphVertex from, GraphVertex to, bool* via_sends_only);
        bool feeds (GraphVertex from, GraphVertex to) const;
        std::set<GraphVertex> from (GraphVertex r) const;
        std::set<GraphVertex> to (GraphVertex r, bool via_sends_only = false) const;
        bool has_none_to (GraphVertex to) const;
        bool empty () const;
        void dump () const;
 
private:
        typedef std::map<GraphVertex, std::set<GraphVertex> > EdgeMap;
        typedef std::multimap<GraphVertex, std::pair<GraphVertex, bool> > EdgeMapWithSends;
 
        void insert (EdgeMap& e, GraphVertex a, GraphVertex b);
 
        EdgeMapWithSends::iterator find_in_from_to_with_sends (GraphVertex, GraphVertex);
        EdgeMapWithSends::iterator find_in_to_from_with_sends (GraphVertex, GraphVertex);
 
        EdgeMapWithSends::const_iterator find_recursively_in_from_to_with_sends (GraphVertex, GraphVertex) const;
 
        EdgeMap _from_to;
        EdgeMap _to_from;
        EdgeMapWithSends _from_to_with_sends;
        EdgeMapWithSends _to_from_with_sends;
};
 
bool topological_sort (GraphNodeList&, GraphEdges&);
 
}
 
#endif