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
131
|
/*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile: vtkDirectedAcyclicGraph.cxx,v $
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
#include "vtkDirectedAcyclicGraph.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkObjectFactory.h"
#include "vtkOutEdgeIterator.h"
#include "vtkSmartPointer.h"
#include <vtksys/stl/vector>
using vtksys_stl::vector;
vtkCxxRevisionMacro(vtkDirectedAcyclicGraph, "$Revision: 1.4 $");
vtkStandardNewMacro(vtkDirectedAcyclicGraph);
//----------------------------------------------------------------------------
vtkDirectedAcyclicGraph::vtkDirectedAcyclicGraph()
{
}
//----------------------------------------------------------------------------
vtkDirectedAcyclicGraph::~vtkDirectedAcyclicGraph()
{
}
//----------------------------------------------------------------------------
vtkDirectedAcyclicGraph *vtkDirectedAcyclicGraph::GetData(vtkInformation *info)
{
return info? vtkDirectedAcyclicGraph::SafeDownCast(info->Get(DATA_OBJECT())) : 0;
}
//----------------------------------------------------------------------------
vtkDirectedAcyclicGraph *vtkDirectedAcyclicGraph::GetData(vtkInformationVector *v, int i)
{
return vtkDirectedAcyclicGraph::GetData(v->GetInformationObject(i));
}
enum { DFS_WHITE, DFS_GRAY, DFS_BLACK };
//----------------------------------------------------------------------------
bool vtkDirectedAcyclicGraphDFSVisit(
vtkGraph *g,
vtkIdType u,
vtksys_stl::vector<int> color,
vtkOutEdgeIterator *adj)
{
color[u] = DFS_GRAY;
g->GetOutEdges(u, adj);
while (adj->HasNext())
{
vtkOutEdgeType e = adj->Next();
vtkIdType v = e.Target;
if (color[v] == DFS_WHITE)
{
if (!vtkDirectedAcyclicGraphDFSVisit(g, v, color, adj))
{
return false;
}
}
else if (color[v] == DFS_GRAY)
{
return false;
}
}
return true;
}
//----------------------------------------------------------------------------
bool vtkDirectedAcyclicGraph::IsStructureValid(vtkGraph *g)
{
if (vtkDirectedAcyclicGraph::SafeDownCast(g))
{
return true;
}
// Empty graph is a valid DAG.
if (g->GetNumberOfVertices() == 0)
{
return true;
}
// A directed graph is acyclic iff a depth-first search of
// the graph yields no back edges.
// (from Introduction to Algorithms.
// Cormen, Leiserson, Rivest, p. 486).
vtkIdType numVerts = g->GetNumberOfVertices();
vector<int> color(numVerts, DFS_BLACK);
vtkIdType s, u;
vtkSmartPointer<vtkOutEdgeIterator> adj =
vtkSmartPointer<vtkOutEdgeIterator>::New();
for (u = 0; u < numVerts; ++u)
{
color[u] = DFS_WHITE;
}
for (s = 0; s < numVerts; ++s)
{
if (color[s] == DFS_WHITE)
{
if (!vtkDirectedAcyclicGraphDFSVisit(g, s, color, adj))
{
return false;
}
}
}
return true;
}
//----------------------------------------------------------------------------
void vtkDirectedAcyclicGraph::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
}
|
