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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
//
// 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
//
#include "DAG.h"
#include "Exception.h"
#include <boost/enable_shared_from_this.hpp>
using namespace std;
namespace avg {
class AVG_API DAGNode: public boost::enable_shared_from_this<DAGNode>
{
public:
DAGNode(long vertexID, const std::set<long>& outgoingIDs);
void resolveIDs(DAG* pDAG);
long m_VertexID;
std::set<long> m_OutgoingIDs;
std::set<DAGNodePtr> m_pOutgoingNodes;
std::set<DAGNodePtr> m_pIncomingNodes;
};
DAGNode::DAGNode(long vertexID, const set<long>& outgoingIDs)
{
m_VertexID = vertexID;
m_OutgoingIDs = outgoingIDs;
}
void DAGNode::resolveIDs(DAG* pDAG)
{
set<long>::iterator it;
for (it=m_OutgoingIDs.begin(); it!=m_OutgoingIDs.end(); ++it) {
long outgoingID = *it;
DAGNodePtr pDestNode = pDAG->findNode(outgoingID);
m_pOutgoingNodes.insert(pDestNode);
pDestNode->m_pIncomingNodes.insert(shared_from_this());
}
m_OutgoingIDs.clear();
}
DAG::DAG()
{
}
DAG::~DAG()
{
}
void DAG::addNode(long vertexID, const set<long>& outgoingIDs)
{
DAGNode* pNode = new DAGNode(vertexID, outgoingIDs);
m_pNodes.insert(DAGNodePtr(pNode));
}
void DAG::sort(vector<long>& pResults)
{
resolveIDs();
while (!m_pNodes.empty()) {
DAGNodePtr pCurNode = findStartNode(*m_pNodes.begin());
removeNode(pCurNode);
pResults.push_back(pCurNode->m_VertexID);
}
}
void DAG::resolveIDs()
{
set<DAGNodePtr>::iterator it;
for (it=m_pNodes.begin(); it!=m_pNodes.end(); ++it) {
(*it)->resolveIDs(this);
}
}
DAGNodePtr DAG::findNode(long id)
{
set<DAGNodePtr>::iterator it;
for (it=m_pNodes.begin(); it!=m_pNodes.end(); ++it) {
if ((*it)->m_VertexID == id) {
return (*it);
}
}
AVG_ASSERT(false);
return DAGNodePtr();
}
void DAG::removeNode(DAGNodePtr pNode)
{
set<DAGNodePtr>::iterator it;
for (it=pNode->m_pOutgoingNodes.begin(); it!=pNode->m_pOutgoingNodes.end(); ++it) {
DAGNodePtr pDestNode = *it;
pDestNode->m_pIncomingNodes.erase(pNode);
}
m_pNodes.erase(pNode);
}
DAGNodePtr DAG::findStartNode(DAGNodePtr pNode, unsigned depth)
{
if (pNode->m_pIncomingNodes.empty()) {
return pNode;
} else {
if (depth > m_pNodes.size()) {
throw Exception(AVG_ERR_INVALID_ARGS, "cyclic graph");
}
return findStartNode(*pNode->m_pIncomingNodes.begin(), depth+1);
}
}
}
|
