-
Notifications
You must be signed in to change notification settings - Fork 51
/
graph.cpp
136 lines (111 loc) · 3.42 KB
/
graph.cpp
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
132
133
134
135
// K-3D
// Copyright (c) 1995-2007, Timothy M. Shead
//
// Contact: [email protected]
//
// 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include <k3dsdk/color.h>
#include <k3dsdk/graph.h>
#include <k3dsdk/type_registry.h>
#include <boost/graph/adjacency_list_io.hpp>
#include <iterator>
namespace k3d
{
namespace graph
{
namespace detail
{
static void print(std::ostream& Stream, const pipeline_data<undirected::adjacency_list_t>& Topology)
{
if(!Topology)
return;
Stream << " vertices: (" << boost::num_vertices(*Topology) << ")\n";
Stream << " edges: (" << boost::num_edges(*Topology) << ")\n";
for(std::pair<undirected::edge_iterator_t, undirected::edge_iterator_t> edges = boost::edges(*Topology); edges.first != edges.second; edges.first)
Stream << " index: " << (*Topology)[*edges.first].index << " edge: " << *edges.first << "\n";
}
template<typename array_t>
static bool print(std::ostream& Stream, const array& Array)
{
if(const array_t* const concrete_array = dynamic_cast<const array_t*>(&Array))
{
std::copy(concrete_array->begin(), concrete_array->end(), std::ostream_iterator<typename array_t::value_type>(Stream, " "));
return true;
}
return false;
}
static void print(std::ostream& Stream, const std::string& Name, const pipeline_data<array>& Array)
{
Stream << " " << Name << ": ";
if(Array)
{
Stream << "(" << Array->size() << ") ";
if(print<graph::bools_t>(Stream, *Array))
{
}
else if(print<graph::indices_t>(Stream, *Array))
{
}
else if(print<graph::doubles_t>(Stream, *Array))
{
}
else if(print<graph::integers_t>(Stream, *Array))
{
}
else if(print<graph::strings_t>(Stream, *Array))
{
}
else if(print<graph::points_2d_t>(Stream, *Array))
{
}
else if(print<graph::vectors_2d_t>(Stream, *Array))
{
}
else if(print<graph::nodes_t>(Stream, *Array))
{
}
else
{
Stream << "unsupported type [" << k3d::demangle(typeid(*Array)) << "]" << std::endl;
}
}
Stream << "\n";
}
static void print(std::ostream& Stream, const k3d::graph::table_t& Arrays)
{
for(k3d::graph::table_t::const_iterator array = Arrays.begin(); array != Arrays.end(); array)
print(Stream, array->first, array->second);
}
} // namespace detail
////////////////////////////////////////////////////////////////////////////////////
// undirected
undirected::undirected()
{
}
/** \todo Print the topology */
std::ostream& operator<<(std::ostream& Stream, const undirected& RHS)
{
Stream << "topology:" << "\n";
detail::print(Stream, RHS.topology);
Stream << "graph data:" << "\n";
detail::print(Stream, RHS.graph_data);
Stream << "vertex data:" << "\n";
detail::print(Stream, RHS.vertex_data);
Stream << "edge data:" << "\n";
detail::print(Stream, RHS.edge_data);
return Stream;
}
} // namespace graph
} // namespace k3d