69 #ifndef vtkBoostGraphAdapter_h
70 #define vtkBoostGraphAdapter_h
88 #include <boost/version.hpp>
100 struct read_write_property_map_tag;
102 #define vtkPropertyMapMacro(T, V) \
104 struct property_traits<T*> \
106 typedef V value_type; \
107 typedef V reference; \
108 typedef vtkIdType key_type; \
109 typedef read_write_property_map_tag category; \
112 inline property_traits<T*>::reference get(T* const& arr, property_traits<T*>::key_type key) \
114 return arr->GetValue(key); \
118 T* arr, property_traits<T*>::key_type key, const property_traits<T*>::value_type& value) \
120 arr->InsertValue(key, value); \
167 #if defined(_MSC_VER)
178 #include <boost/config.hpp>
179 #include <boost/version.hpp>
181 #if BOOST_VERSION > 107300 && BOOST_VERSION < 107600
182 #define BOOST_ALLOW_DEPRECATED_HEADERS
183 #define BOOST_BIND_GLOBAL_PLACEHOLDERS
186 #include <boost/graph/adjacency_iterator.hpp>
187 #include <boost/graph/graph_traits.hpp>
188 #include <boost/graph/properties.hpp>
189 #include <boost/iterator/iterator_facade.hpp>
199 :
public iterator_facade<vtk_vertex_iterator, vtkIdType, bidirectional_traversal_tag,
200 const vtkIdType&, vtkIdType>
209 const vtkIdType& dereference()
const {
return index; }
213 void increment() { index++; }
214 void decrement() { index--; }
222 :
public iterator_facade<vtk_edge_iterator, vtkEdgeType, forward_traversal_tag,
223 const vtkEdgeType&, vtkIdType>
251 while (vertex < lastVertex && this->graph->
GetOutDegree(vertex) == 0)
256 if (vertex < lastVertex)
297 return vertex == other.vertex && iter == other.iter;
333 while (vertex < lastVertex && this->graph->
GetOutDegree(vertex) == 0)
338 if (vertex < lastVertex)
351 void RecalculateEdge()
371 :
public iterator_facade<vtk_out_edge_pointer_iterator, vtkEdgeType, bidirectional_traversal_tag,
372 const vtkEdgeType&, ptrdiff_t>
382 g->GetOutEdges(vertex, iter, nedges);
412 void RecalculateEdge()
428 :
public iterator_facade<vtk_in_edge_pointer_iterator, vtkEdgeType, bidirectional_traversal_tag,
429 const vtkEdgeType&, ptrdiff_t>
439 g->GetInEdges(vertex, iter, nedges);
469 void RecalculateEdge()
491 :
public virtual bidirectional_graph_tag
492 ,
public virtual edge_list_graph_tag
493 ,
public virtual vertex_list_graph_tag
494 ,
public virtual adjacency_graph_tag
521 #if BOOST_VERSION >= 104500
523 struct graph_property_type<
vtkGraph*>
525 typedef no_property
type;
541 #if BOOST_VERSION >= 104500
545 typedef no_property
type;
599 #if BOOST_VERSION >= 104500
602 struct graph_property_type<
vtkDirectedGraph*> : graph_property_type<vtkGraph*>
608 struct graph_property_type<
vtkDirectedGraph*
const> : graph_property_type<vtkGraph*>
637 #if BOOST_VERSION >= 104500
646 struct graph_bundle_type<
vtkDirectedGraph*
const> : graph_bundle_type<vtkGraph*>
715 #if BOOST_VERSION >= 104500
724 struct graph_property_type<
vtkUndirectedGraph*
const> : graph_property_type<vtkGraph*>
753 #if BOOST_VERSION >= 104500
811 #if BOOST_VERSION >= 104500
850 #if BOOST_VERSION >= 104500
908 #if BOOST_VERSION >= 104500
918 : graph_property_type<vtkUndirectedGraph*>
949 #if BOOST_VERSION >= 104500
1017 inline std::pair<boost::graph_traits<vtkGraph*>::vertex_iterator,
1032 inline std::pair<boost::graph_traits<vtkGraph*>::edge_iterator,
1040 inline std::pair<boost::graph_traits<vtkGraph*>::out_edge_iterator,
1045 std::pair<Iter, Iter> p = std::make_pair(Iter(g, u), Iter(g, u,
true));
1049 inline std::pair<boost::graph_traits<vtkGraph*>::in_edge_iterator,
1054 std::pair<Iter, Iter> p = std::make_pair(Iter(g, u), Iter(g, u,
true));
1058 inline std::pair<boost::graph_traits<vtkGraph*>::adjacency_iterator,
1064 std::pair<OutEdgeIter, OutEdgeIter> out =
out_edges(u, g);
1065 return std::make_pair(Iter(out.first, &g), Iter(out.second, &g));
1102 inline std::pair<boost::graph_traits<vtkMutableDirectedGraph*>::edge_descriptor,
bool>
add_edge(
1107 return std::make_pair(e,
true);
1116 inline std::pair<boost::graph_traits<vtkMutableUndirectedGraph*>::edge_descriptor,
bool>
add_edge(
1122 return std::make_pair(e,
true);
1154 template <
typename PMap>
1171 template <
typename PMap>
1178 template <
typename PMap>
1189 template <
typename PMap>
1206 template <
typename PMap>
1213 template <
typename PMap>
1246 template <
typename PMap>
1263 template <
typename PMap>
1270 template <
typename PMap>
1350 #if BOOST_VERSION > 104000
1351 #include <boost/property_map/vector_property_map.hpp>
1353 #include <boost/vector_property_map.hpp>
property_traits< PMap >::reference reference
property_traits< PMap >::category category
property_traits< PMap >::value_type value_type
vtkGraphEdgePropertyMapHelper(PMap m)
reference operator[](const key_type &key) const
vtkGraphPropertyMapMultiplier(PMap m, float multi=1)
property_traits< PMap >::value_type value_type
property_traits< PMap >::reference reference
property_traits< PMap >::key_type key_type
property_traits< PMap >::category category
property_traits< PMap >::reference reference
property_traits< PMap >::value_type value_type
vtkGraphVertexPropertyMapHelper(PMap m)
reference operator[](const key_type &key) const
property_traits< PMap >::category category
friend class iterator_core_access
vtk_edge_iterator(vtkGraph *g=0, vtkIdType v=0)
friend class iterator_core_access
vtk_in_edge_pointer_iterator(vtkGraph *g=0, vtkIdType v=0, bool end=false)
vtk_out_edge_pointer_iterator(vtkGraph *g=0, vtkIdType v=0, bool end=false)
friend class iterator_core_access
friend class iterator_core_access
vtk_vertex_iterator(vtkIdType i=0)
Abstract superclass for all arrays.
virtual vtkVariant GetVariantValue(vtkIdType valueIdx)
Retrieve value from the array as a variant.
virtual void InsertVariantValue(vtkIdType valueIdx, vtkVariant value)=0
Insert a value into the array from a variant.
abstract superclass for arrays of numeric data
void SetTuple1(vtkIdType tupleIdx, double value)
These methods are included as convenience for the wrappers.
double GetTuple1(vtkIdType tupleIdx)
These methods are included as convenience for the wrappers.
static vtkInformationIntegerKey * DATA_PIECE_NUMBER()
virtual vtkInformation * GetInformation()
Set/Get the information object associated with this data object.
static vtkDirectedGraph * SafeDownCast(vtkObjectBase *o)
helper for the vtkGraph class that allows the graph to be distributed across multiple memory spaces.
vtkIdType GetEdgeOwner(vtkIdType e_id) const
Returns owner of edge with ID e_id, by extracting top ceil(log2 P) bits of e_id.
vtkIdType MakeDistributedId(int owner, vtkIdType local)
Builds a distributed ID consisting of the given owner and the local ID.
vtkIdType GetVertexOwner(vtkIdType v) const
Returns owner of vertex v, by extracting top ceil(log2 P) bits of v.
dynamic, self-adjusting array of double
dynamic, self-adjusting array of float
Base class for graph data types.
virtual vtkIdType GetOutDegree(vtkIdType v)
The number of outgoing edges from vertex v.
vtkDistributedGraphHelper * GetDistributedGraphHelper()
Retrieves the distributed graph helper for this graph.
virtual vtkIdType GetNumberOfVertices()
The number of vertices in the graph.
virtual void GetOutEdges(vtkIdType v, vtkOutEdgeIterator *it)
Initializes the out edge iterator to iterate over all outgoing edges of vertex v.
virtual vtkIdType GetNumberOfEdges()
The number of edges in the graph.
virtual vtkIdType GetInDegree(vtkIdType v)
The number of incoming edges to vertex v.
virtual vtkIdType GetDegree(vtkIdType v)
The total of all incoming and outgoing vertices for vertex v.
dynamic, self-adjusting array of vtkIdType
dynamic, self-adjusting array of int
An editable directed graph.
void RemoveEdge(vtkIdType e)
Removes the edge from the graph.
vtkIdType AddVertex()
Adds a vertex to the graph and returns the index of the new vertex.
static vtkMutableDirectedGraph * SafeDownCast(vtkObjectBase *o)
vtkEdgeType AddEdge(vtkIdType u, vtkIdType v)
Adds a directed edge from u to v, where u and v are vertex indices, and returns a vtkEdgeType structu...
An editable undirected graph.
static vtkMutableUndirectedGraph * SafeDownCast(vtkObjectBase *o)
void RemoveEdge(vtkIdType e)
Removes the edge from the graph.
vtkIdType AddVertex()
Adds a vertex to the graph and returns the index of the new vertex.
vtkEdgeType AddEdge(vtkIdType u, vtkIdType v)
Adds an undirected edge from u to v, where u and v are vertex indices, and returns a vtkEdgeType stru...
A rooted tree data structure.
A atomic type representing the union of many types.
Forward declaration required for Boost serialization.
bool has_no_edges(vtkGraph *g)
vtkPropertyMapMacro(vtkIntArray, int)
void remove_edge(graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *g)
vtkGraphIndexMap get(edge_index_t, vtkGraph *)
void put(vtkGraphPropertyMapMultiplier< PMap > multi, const typename property_traits< PMap >::key_type &key, const typename property_traits< PMap >::value_type &value)
double get(vtkDataArray *const &arr, vtkIdType key)
void put(vtkDataArray *arr, vtkIdType key, const double &value)
directed_tag directed_category
vtk_in_edge_pointer_iterator in_edge_iterator
vtkIdType edges_size_type
allow_parallel_edge_tag edge_parallel_category
vtkIdType vertex_descriptor
vtk_vertex_iterator vertex_iterator
vtk_out_edge_pointer_iterator out_edge_iterator
static vertex_descriptor null_vertex()
adjacency_iterator_generator< vtkGraph *, vertex_descriptor, out_edge_iterator >::type adjacency_iterator
vtkIdType vertices_size_type
vtkGraph_traversal_category traversal_category
vtkEdgeType edge_descriptor
vtkIdType degree_size_type
vtk_edge_iterator edge_iterator
static edge_descriptor null_edge()
undirected_tag directed_category
vtkGraphIndexMap const_type
vtkGraphIndexMap const_type
read_write_property_map_tag category
read_write_property_map_tag category
readable_property_map_tag category
readable_property_map_tag category
std::pair< boost::graph_traits< vtkMutableDirectedGraph * >::edge_descriptor, bool > add_edge(boost::graph_traits< vtkMutableDirectedGraph * >::vertex_descriptor u, boost::graph_traits< vtkMutableDirectedGraph * >::vertex_descriptor v, vtkMutableDirectedGraph *g)
boost::graph_traits< vtkDirectedGraph * >::degree_size_type in_degree(boost::graph_traits< vtkDirectedGraph * >::vertex_descriptor u, vtkDirectedGraph *g)
boost::graph_traits< vtkGraph * >::degree_size_type degree(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::adjacency_iterator, boost::graph_traits< vtkGraph * >::adjacency_iterator > adjacent_vertices(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
boost::graph_traits< vtkGraph * >::vertices_size_type num_vertices(vtkGraph *g)
boost::graph_traits< vtkGraph * >::degree_size_type out_degree(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
boost::graph_traits< vtkGraph * >::vertex_descriptor source(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::out_edge_iterator, boost::graph_traits< vtkGraph * >::out_edge_iterator > out_edges(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
boost::graph_traits< vtkMutableDirectedGraph * >::vertex_descriptor add_vertex(vtkMutableDirectedGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::in_edge_iterator, boost::graph_traits< vtkGraph * >::in_edge_iterator > in_edges(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::vertex_iterator, boost::graph_traits< vtkGraph * >::vertex_iterator > vertices(vtkGraph *g)
boost::graph_traits< vtkGraph * >::edges_size_type num_edges(vtkGraph *g)
boost::graph_traits< vtkGraph * >::vertex_descriptor target(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)