69#ifndef vtkBoostGraphAdapter_h
70#define vtkBoostGraphAdapter_h
88#include <boost/version.hpp>
100struct 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); \
178#include <boost/config.hpp>
179#include <boost/graph/adjacency_iterator.hpp>
180#include <boost/graph/graph_traits.hpp>
181#include <boost/graph/properties.hpp>
182#include <boost/iterator/iterator_facade.hpp>
192 :
public iterator_facade<vtk_vertex_iterator, vtkIdType, bidirectional_traversal_tag,
193 const vtkIdType&, vtkIdType>
202 const vtkIdType& dereference()
const {
return index; }
204 bool equal(
const vtk_vertex_iterator& other)
const {
return index == other.index; }
206 void increment() { index++; }
207 void decrement() { index--; }
215 :
public iterator_facade<vtk_edge_iterator, vtkEdgeType, forward_traversal_tag,
216 const vtkEdgeType&, vtkIdType>
244 while (vertex < lastVertex && this->graph->
GetOutDegree(vertex) == 0)
249 if (vertex < lastVertex)
288 bool equal(
const vtk_edge_iterator& other)
const
290 return vertex == other.vertex && iter == other.iter;
326 while (vertex < lastVertex && this->graph->
GetOutDegree(vertex) == 0)
331 if (vertex < lastVertex)
344 void RecalculateEdge()
364 :
public iterator_facade<vtk_out_edge_pointer_iterator, vtkEdgeType, bidirectional_traversal_tag,
365 const vtkEdgeType&, ptrdiff_t>
375 g->GetOutEdges(vertex, iter, nedges);
391 bool equal(
const vtk_out_edge_pointer_iterator& other)
const {
return iter == other.iter; }
405 void RecalculateEdge()
421 :
public iterator_facade<vtk_in_edge_pointer_iterator, vtkEdgeType, bidirectional_traversal_tag,
422 const vtkEdgeType&, ptrdiff_t>
432 g->GetInEdges(vertex, iter, nedges);
448 bool equal(
const vtk_in_edge_pointer_iterator& other)
const {
return iter == other.iter; }
462 void RecalculateEdge()
484 :
public virtual bidirectional_graph_tag
485 ,
public virtual edge_list_graph_tag
486 ,
public virtual vertex_list_graph_tag
487 ,
public virtual adjacency_graph_tag
510 typedef adjacency_iterator_generator<vtkGraph*, vertex_descriptor, out_edge_iterator>::type
514#if BOOST_VERSION >= 104500
516struct graph_property_type<
vtkGraph*>
518 typedef no_property type;
534#if BOOST_VERSION >= 104500
538 typedef no_property type;
592#if BOOST_VERSION >= 104500
595struct graph_property_type<
vtkDirectedGraph*> : graph_property_type<vtkGraph*>
601struct graph_property_type<
vtkDirectedGraph*
const> : graph_property_type<vtkGraph*>
630#if BOOST_VERSION >= 104500
639struct graph_bundle_type<
vtkDirectedGraph*
const> : graph_bundle_type<vtkGraph*>
672struct graph_traits<
vtkTree*> : graph_traits<vtkDirectedGraph*>
678struct graph_traits<const
vtkTree*> : graph_traits<vtkTree*>
684struct graph_traits<
vtkTree*
const> : graph_traits<vtkTree*>
708#if BOOST_VERSION >= 104500
746#if BOOST_VERSION >= 104500
804#if BOOST_VERSION >= 104500
827 : vertex_property_type<vtkDirectedGraph*>
843#if BOOST_VERSION >= 104500
901#if BOOST_VERSION >= 104500
911 : graph_property_type<vtkUndirectedGraph*>
925 : vertex_property_type<vtkUndirectedGraph*>
938 : edge_property_type<vtkUndirectedGraph*>
942#if BOOST_VERSION >= 104500
965 : vertex_bundle_type<vtkUndirectedGraph*>
998inline boost::graph_traits<vtkGraph*>::vertex_descriptor
source(
999 boost::graph_traits<vtkGraph*>::edge_descriptor e,
vtkGraph*)
1004inline boost::graph_traits<vtkGraph*>::vertex_descriptor
target(
1005 boost::graph_traits<vtkGraph*>::edge_descriptor e,
vtkGraph*)
1010inline std::pair<boost::graph_traits<vtkGraph*>::vertex_iterator,
1011 boost::graph_traits<vtkGraph*>::vertex_iterator>
1014 typedef boost::graph_traits<vtkGraph*>::vertex_iterator Iter;
1025inline std::pair<boost::graph_traits<vtkGraph*>::edge_iterator,
1026 boost::graph_traits<vtkGraph*>::edge_iterator>
1029 typedef boost::graph_traits<vtkGraph*>::edge_iterator Iter;
1033inline std::pair<boost::graph_traits<vtkGraph*>::out_edge_iterator,
1034 boost::graph_traits<vtkGraph*>::out_edge_iterator>
1037 typedef boost::graph_traits<vtkGraph*>::out_edge_iterator Iter;
1038 std::pair<Iter, Iter> p = std::make_pair(Iter(g, u), Iter(g, u,
true));
1042inline std::pair<boost::graph_traits<vtkGraph*>::in_edge_iterator,
1043 boost::graph_traits<vtkGraph*>::in_edge_iterator>
1046 typedef boost::graph_traits<vtkGraph*>::in_edge_iterator Iter;
1047 std::pair<Iter, Iter> p = std::make_pair(Iter(g, u), Iter(g, u,
true));
1051inline std::pair<boost::graph_traits<vtkGraph*>::adjacency_iterator,
1052 boost::graph_traits<vtkGraph*>::adjacency_iterator>
1055 typedef boost::graph_traits<vtkGraph*>::adjacency_iterator Iter;
1056 typedef boost::graph_traits<vtkGraph*>::out_edge_iterator OutEdgeIter;
1057 std::pair<OutEdgeIter, OutEdgeIter> out =
out_edges(u, g);
1058 return std::make_pair(Iter(out.first, &g), Iter(out.second, &g));
1071inline boost::graph_traits<vtkGraph*>::degree_size_type
out_degree(
1072 boost::graph_traits<vtkGraph*>::vertex_descriptor u,
vtkGraph* g)
1077inline boost::graph_traits<vtkDirectedGraph*>::degree_size_type
in_degree(
1078 boost::graph_traits<vtkDirectedGraph*>::vertex_descriptor u,
vtkDirectedGraph* g)
1083inline boost::graph_traits<vtkGraph*>::degree_size_type
degree(
1084 boost::graph_traits<vtkGraph*>::vertex_descriptor u,
vtkGraph* g)
1089inline boost::graph_traits<vtkMutableDirectedGraph*>::vertex_descriptor
add_vertex(
1095inline std::pair<boost::graph_traits<vtkMutableDirectedGraph*>::edge_descriptor,
bool>
add_edge(
1096 boost::graph_traits<vtkMutableDirectedGraph*>::vertex_descriptor u,
1099 boost::graph_traits<vtkMutableDirectedGraph*>::edge_descriptor e = g->
AddEdge(u, v);
1100 return std::make_pair(e,
true);
1103inline boost::graph_traits<vtkMutableUndirectedGraph*>::vertex_descriptor
add_vertex(
1109inline std::pair<boost::graph_traits<vtkMutableUndirectedGraph*>::edge_descriptor,
bool>
add_edge(
1110 boost::graph_traits<vtkMutableUndirectedGraph*>::vertex_descriptor u,
1111 boost::graph_traits<vtkMutableUndirectedGraph*>::vertex_descriptor v,
1114 boost::graph_traits<vtkMutableUndirectedGraph*>::edge_descriptor e = g->
AddEdge(u, v);
1115 return std::make_pair(e,
true);
1147template <
typename PMap>
1164template <
typename PMap>
1168 return get(helper.
pmap, key.Id);
1171template <
typename PMap>
1175 put(helper.
pmap, key.Id, value);
1182template <
typename PMap>
1199template <
typename PMap>
1206template <
typename PMap>
1239template <
typename PMap>
1256template <
typename PMap>
1263template <
typename PMap>
1281struct property_map<
vtkDirectedGraph*, vertex_index_t> : property_map<vtkGraph*, vertex_index_t>
1320 : property_map<vtkDirectedGraph*, vertex_index_t>
1326 : property_map<vtkUndirectedGraph*, vertex_index_t>
1332 : property_map<vtkDirectedGraph*, edge_index_t>
1338 : property_map<vtkUndirectedGraph*, edge_index_t>
1343#if BOOST_VERSION > 104000
1344#include <boost/property_map/vector_property_map.hpp>
1346#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.
virtual vtkInformation * GetInformation()
Set/Get the information object associated with this data object.
static vtkInformationIntegerKey * DATA_PIECE_NUMBER()
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.
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.
vtkDistributedGraphHelper * GetDistributedGraphHelper()
Retrieves the distributed graph helper for this graph.
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.
static vtkMutableDirectedGraph * SafeDownCast(vtkObjectBase *o)
vtkIdType AddVertex()
Adds a vertex to the graph and returns the index of the new vertex.
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)
void remove_edge(graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *g)
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
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)
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< vtkGraph * >::vertices_size_type num_vertices(vtkGraph *g)
boost::graph_traits< vtkGraph * >::vertex_descriptor source(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)
#define vtkPropertyMapMacro(T, V)
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< vtkMutableDirectedGraph * >::vertex_descriptor add_vertex(vtkMutableDirectedGraph *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)
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 * >::vertex_descriptor target(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)
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< vtkGraph * >::edges_size_type num_edges(vtkGraph *g)