1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
/*
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.
*/
#include <map>
#include <set>
namespace ARDOUR {
typedef boost::shared_ptr<Route> DAGVertex;
/** A list of edges for a directed acyclic graph for routes */
class DAGEdges
{
public:
typedef std::map<DAGVertex, std::set<DAGVertex> > EdgeMap;
void add (DAGVertex from, DAGVertex to);
std::set<DAGVertex> from (DAGVertex r) const;
void remove (DAGVertex from, DAGVertex to);
bool has_none_to (DAGVertex to) const;
bool empty () const;
void dump () const;
private:
void insert (EdgeMap& e, DAGVertex a, DAGVertex b);
/* Keep a map in both directions to speed lookups */
/** map of edges with from as `first' and to as `second' */
EdgeMap _from_to;
/** map of the same edges with to as `first' and from as `second' */
EdgeMap _to_from;
};
boost::shared_ptr<RouteList> topological_sort (
boost::shared_ptr<RouteList>,
DAGEdges
);
}
|
