route_graph.h

Go to the documentation of this file.

/*
    Copyright (C) 2011 Paul Davis
    Author: Carl Hetherington <cth@carlh.net>

    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., 675 Mass Ave, Cambridge, MA 02139, USA.

*/

#ifndef __ardour_route_graph_h__
#define __ardour_route_graph_h__

#include <map>
#include <set>

namespace ARDOUR {

typedef boost::shared_ptr<Route> GraphVertex;

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);
        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);

        EdgeMap _from_to;
        EdgeMap _to_from;
        EdgeMapWithSends _from_to_with_sends;
};

boost::shared_ptr<RouteList> topological_sort (
        boost::shared_ptr<RouteList>,
        GraphEdges
        );

}

#endif