blob: 929ecd240ea61f342d6abb11cd016f28c6323322 (
plain)
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
59
60
61
62
63
64
|
//
// libavg - Media Playback Engine.
// Copyright (C) 2003-2014 Ulrich von Zadow
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2 of the License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// Current versions can be found at www.libavg.de
//
#ifndef _DAG_H_
#define _DAG_H_
#include "../api.h"
#include <set>
#include <vector>
#include <boost/shared_ptr.hpp>
namespace avg {
class DAG;
class DAGNode;
typedef boost::shared_ptr<DAGNode> DAGNodePtr;
// Directed Acyclic Graph class.
// Only useful for sorting. The process of sorting destroys the DAG.
class AVG_API DAG
{
public:
DAG();
virtual ~DAG();
void addNode(long vertexID, const std::set<long>& outgoingIDs);
void sort(std::vector<long>& pResults);
private:
friend class DAGNode;
void resolveIDs();
DAGNodePtr findNode(long pID);
void removeNode(DAGNodePtr pNode);
DAGNodePtr findStartNode(DAGNodePtr pNode, unsigned depth=0);
std::set<DAGNodePtr> m_pNodes;
};
}
#endif
|
