30 #ifndef vtkBoostGraphAdapter_h
31 #define vtkBoostGraphAdapter_h
49 #include <boost/version.hpp>
61 struct read_write_property_map_tag;
63 #define vtkPropertyMapMacro(T, V) \
65 struct property_traits<T*> \
67 typedef V value_type; \
68 typedef V reference; \
69 typedef vtkIdType key_type; \
70 typedef read_write_property_map_tag category; \
73 inline property_traits<T*>::reference get(T* const& arr, property_traits<T*>::key_type key) \
75 return arr->GetValue(key); \
79 T* arr, property_traits<T*>::key_type key, const property_traits<T*>::value_type& value) \
81 arr->InsertValue(key, value); \
101 return arr->GetTuple1(
key);
121 return arr->GetVariantValue(
key);
128 #if defined(_MSC_VER)
139 #include <boost/config.hpp>
140 #include <boost/version.hpp>
142 #if BOOST_VERSION > 107300 && BOOST_VERSION < 107600
143 #define BOOST_ALLOW_DEPRECATED_HEADERS
144 #define BOOST_BIND_GLOBAL_PLACEHOLDERS
147 #include <boost/graph/adjacency_iterator.hpp>
148 #include <boost/graph/graph_traits.hpp>
149 #include <boost/graph/properties.hpp>
150 #include <boost/iterator/iterator_facade.hpp>
160 :
public iterator_facade<vtk_vertex_iterator, vtkIdType, bidirectional_traversal_tag,
161 const vtkIdType&, vtkIdType>
170 const vtkIdType& dereference()
const {
return index; }
174 void increment() { index++; }
175 void decrement() { index--; }
183 :
public iterator_facade<vtk_edge_iterator, vtkEdgeType, forward_traversal_tag,
184 const vtkEdgeType&, vtkIdType>
212 while (vertex < lastVertex && this->graph->
GetOutDegree(vertex) == 0)
217 if (vertex < lastVertex)
258 return vertex == other.vertex && iter == other.iter;
294 while (vertex < lastVertex && this->graph->
GetOutDegree(vertex) == 0)
299 if (vertex < lastVertex)
312 void RecalculateEdge()
332 :
public iterator_facade<vtk_out_edge_pointer_iterator, vtkEdgeType, bidirectional_traversal_tag,
333 const vtkEdgeType&, ptrdiff_t>
343 g->GetOutEdges(vertex, iter, nedges);
373 void RecalculateEdge()
389 :
public iterator_facade<vtk_in_edge_pointer_iterator, vtkEdgeType, bidirectional_traversal_tag,
390 const vtkEdgeType&, ptrdiff_t>
400 g->GetInEdges(vertex, iter, nedges);
430 void RecalculateEdge()
452 :
public virtual bidirectional_graph_tag
453 ,
public virtual edge_list_graph_tag
454 ,
public virtual vertex_list_graph_tag
455 ,
public virtual adjacency_graph_tag
482 #if BOOST_VERSION >= 104500
484 struct graph_property_type<
vtkGraph*>
486 typedef no_property
type;
502 #if BOOST_VERSION >= 104500
506 typedef no_property
type;
560 #if BOOST_VERSION >= 104500
563 struct graph_property_type<
vtkDirectedGraph*> : graph_property_type<vtkGraph*>
569 struct graph_property_type<
vtkDirectedGraph*
const> : graph_property_type<vtkGraph*>
598 #if BOOST_VERSION >= 104500
607 struct graph_bundle_type<
vtkDirectedGraph*
const> : graph_bundle_type<vtkGraph*>
676 #if BOOST_VERSION >= 104500
685 struct graph_property_type<
vtkUndirectedGraph*
const> : graph_property_type<vtkGraph*>
714 #if BOOST_VERSION >= 104500
772 #if BOOST_VERSION >= 104500
811 #if BOOST_VERSION >= 104500
869 #if BOOST_VERSION >= 104500
879 : graph_property_type<vtkUndirectedGraph*>
910 #if BOOST_VERSION >= 104500
978 inline std::pair<boost::graph_traits<vtkGraph*>::vertex_iterator,
993 inline std::pair<boost::graph_traits<vtkGraph*>::edge_iterator,
1001 inline std::pair<boost::graph_traits<vtkGraph*>::out_edge_iterator,
1006 std::pair<Iter, Iter> p = std::make_pair(Iter(g, u), Iter(g, u,
true));
1010 inline std::pair<boost::graph_traits<vtkGraph*>::in_edge_iterator,
1015 std::pair<Iter, Iter> p = std::make_pair(Iter(g, u), Iter(g, u,
true));
1019 inline std::pair<boost::graph_traits<vtkGraph*>::adjacency_iterator,
1025 std::pair<OutEdgeIter, OutEdgeIter> out =
out_edges(u, g);
1026 return std::make_pair(Iter(out.first, &g), Iter(out.second, &g));
1063 inline std::pair<boost::graph_traits<vtkMutableDirectedGraph*>::edge_descriptor,
bool>
add_edge(
1068 return std::make_pair(e,
true);
1077 inline std::pair<boost::graph_traits<vtkMutableUndirectedGraph*>::edge_descriptor,
bool>
add_edge(
1083 return std::make_pair(e,
true);
1115 template <
typename PMap>
1132 template <
typename PMap>
1136 return get(helper.pmap,
key.Id);
1139 template <
typename PMap>
1150 template <
typename PMap>
1167 template <
typename PMap>
1171 return get(helper.pmap,
key);
1174 template <
typename PMap>
1207 template <
typename PMap>
1224 template <
typename PMap>
1228 return multi.multiplier *
get(multi.pmap,
key);
1231 template <
typename PMap>
1311 #if BOOST_VERSION > 104000
1312 #include <boost/property_map/vector_property_map.hpp>
1314 #include <boost/vector_property_map.hpp>
1317 #endif // vtkBoostGraphAdapter_h
static vtkDirectedGraph * SafeDownCast(vtkObjectBase *o)
virtual vtkIdType GetNumberOfEdges()
The number of edges in the graph.
helper for the vtkGraph class that allows the graph to be distributed across multiple memory spaces...
property_traits< PMap >::reference reference
property_traits< PMap >::category category
vtk_out_edge_pointer_iterator(vtkGraph *g=0, vtkIdType v=0, bool end=false)
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...
vtkGraphEdgePropertyMapHelper(PMap m)
virtual vtkInformation * GetInformation()
Set/Get the information object associated with this data object.
read_write_property_map_tag category
void put(vtkGraphPropertyMapMultiplier< PMap > multi, const typename property_traits< PMap >::key_type &key, const typename property_traits< PMap >::value_type &value)
vtkIdType AddVertex()
Adds a vertex to the graph and returns the index of the new vertex.
Forward declaration required for Boost serialization.
vtkGraphVertexPropertyMapHelper(PMap m)
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)
virtual vtkIdType GetNumberOfVertices()
The number of vertices in the graph.
vtk_out_edge_pointer_iterator out_edge_iterator
property_traits< PMap >::reference reference
vtkIdType degree_size_type
Abstract superclass for all arrays.
vtkGraphPropertyMapMultiplier(PMap m, float multi=1)
friend class iterator_core_access
property_traits< PMap >::category category
vtkIdType GetEdgeOwner(vtkIdType e_id) const
Returns owner of edge with ID e_id, by extracting top ceil(log2 P) bits of e_id.
vtkGraph_traversal_category traversal_category
directed_tag directed_category
vtk_in_edge_pointer_iterator in_edge_iterator
vtkIdType edges_size_type
dynamic, self-adjusting array of float
vtkIdType GetVertexOwner(vtkIdType v) const
Returns owner of vertex v, by extracting top ceil(log2 P) bits of v.
vtk_edge_iterator edge_iterator
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)
dynamic, self-adjusting array of vtkIdType
property_traits< PMap >::key_type key_type
std::pair< boost::graph_traits< vtkGraph * >::vertex_iterator, boost::graph_traits< vtkGraph * >::vertex_iterator > vertices(vtkGraph *g)
property_traits< PMap >::reference reference
read_write_property_map_tag category
boost::graph_traits< vtkGraph * >::edges_size_type num_edges(vtkGraph *g)
vtkGraphIndexMap const_type
boost::graph_traits< vtkGraph * >::vertices_size_type num_vertices(vtkGraph *g)
vtkIdType vertices_size_type
vtkEdgeType edge_descriptor
A atomic type representing the union of many types.
dynamic, self-adjusting array of double
void remove_edge(graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *g)
Base class for graph data types.
readable_property_map_tag category
dynamic, self-adjusting array of int
static vtkInformationIntegerKey * DATA_PIECE_NUMBER()
adjacency_iterator_generator< vtkGraph *, vertex_descriptor, out_edge_iterator >::type adjacency_iterator
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...
virtual vtkIdType GetDegree(vtkIdType v)
The total of all incoming and outgoing vertices for vertex v.
undirected_tag directed_category
static vertex_descriptor null_vertex()
vtkIdType vertex_descriptor
allow_parallel_edge_tag edge_parallel_category
static edge_descriptor null_edge()
property_traits< PMap >::category category
boost::graph_traits< vtkGraph * >::vertex_descriptor target(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)
friend class iterator_core_access
friend class iterator_core_access
abstract superclass for arrays of numeric data
void put(vtkDataArray *arr, vtkIdType key, const double &value)
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)
An editable directed graph.
bool has_no_edges(vtkGraph *g)
boost::graph_traits< vtkMutableDirectedGraph * >::vertex_descriptor add_vertex(vtkMutableDirectedGraph *g)
virtual void InsertVariantValue(vtkIdType valueIdx, vtkVariant value)=0
Insert a value into the array from a variant.
void SetTuple1(vtkIdType tupleIdx, double value)
These methods are included as convenience for the wrappers.
An editable undirected graph.
reference operator[](const key_type &key) const
boost::graph_traits< vtkGraph * >::vertex_descriptor source(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)
virtual vtkIdType GetInDegree(vtkIdType v)
The number of incoming edges to vertex v.
vtkGraphIndexMap const_type
property_traits< PMap >::value_type value_type
static vtkMutableDirectedGraph * SafeDownCast(vtkObjectBase *o)
vtkDistributedGraphHelper * GetDistributedGraphHelper()
Retrieves the distributed graph helper for this graph.
vtk_in_edge_pointer_iterator(vtkGraph *g=0, vtkIdType v=0, bool end=false)
vtk_vertex_iterator(vtkIdType i=0)
vtk_edge_iterator(vtkGraph *g=0, vtkIdType v=0)
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)
vtk_vertex_iterator vertex_iterator
reference operator[](const key_type &key) const
property_traits< PMap >::value_type value_type
vtkIdType AddVertex()
Adds a vertex to the graph and returns the index of the new vertex.
A rooted tree data structure.
friend class iterator_core_access
virtual void GetOutEdges(vtkIdType v, vtkOutEdgeIterator *it)
Initializes the out edge iterator to iterate over all outgoing edges of vertex v. ...
property_traits< PMap >::value_type value_type
void RemoveEdge(vtkIdType e)
Removes the edge from the graph.
void RemoveEdge(vtkIdType e)
Removes the edge from the graph.
vtkIdType MakeDistributedId(int owner, vtkIdType local)
Builds a distributed ID consisting of the given owner and the local ID.
static vtkMutableUndirectedGraph * SafeDownCast(vtkObjectBase *o)
boost::graph_traits< vtkGraph * >::degree_size_type out_degree(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
boost::graph_traits< vtkGraph * >::degree_size_type degree(boost::graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g)
boost::graph_traits< vtkDirectedGraph * >::degree_size_type in_degree(boost::graph_traits< vtkDirectedGraph * >::vertex_descriptor u, vtkDirectedGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
virtual vtkIdType GetOutDegree(vtkIdType v)
The number of outgoing edges from vertex v.
vtkGraphIndexMap get(edge_index_t, vtkGraph *)
vtkPropertyMapMacro(vtkIntArray, int)