30#ifndef vtkBoostGraphAdapter_h
31#define vtkBoostGraphAdapter_h
49#include <boost/version.hpp>
61struct 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); \
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
478 typedef adjacency_iterator_generator<vtkGraph*, vertex_descriptor, out_edge_iterator>::type
482#if BOOST_VERSION >= 104500
484struct graph_property_type<
vtkGraph*>
486 typedef no_property type;
502#if BOOST_VERSION >= 104500
506 typedef no_property type;
560#if BOOST_VERSION >= 104500
563struct graph_property_type<
vtkDirectedGraph*> : graph_property_type<vtkGraph*>
569struct graph_property_type<
vtkDirectedGraph*
const> : graph_property_type<vtkGraph*>
598#if BOOST_VERSION >= 104500
607struct graph_bundle_type<
vtkDirectedGraph*
const> : graph_bundle_type<vtkGraph*>
640struct graph_traits<
vtkTree*> : graph_traits<vtkDirectedGraph*>
646struct graph_traits<const
vtkTree*> : graph_traits<vtkTree*>
652struct graph_traits<
vtkTree*
const> : graph_traits<vtkTree*>
676#if BOOST_VERSION >= 104500
714#if BOOST_VERSION >= 104500
772#if BOOST_VERSION >= 104500
795 : vertex_property_type<vtkDirectedGraph*>
811#if BOOST_VERSION >= 104500
869#if BOOST_VERSION >= 104500
879 : graph_property_type<vtkUndirectedGraph*>
893 : vertex_property_type<vtkUndirectedGraph*>
906 : edge_property_type<vtkUndirectedGraph*>
910#if BOOST_VERSION >= 104500
933 : vertex_bundle_type<vtkUndirectedGraph*>
978inline std::pair<boost::graph_traits<vtkGraph*>::vertex_iterator,
993inline std::pair<boost::graph_traits<vtkGraph*>::edge_iterator,
1001inline 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));
1010inline 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));
1019inline 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));
1063inline std::pair<boost::graph_traits<vtkMutableDirectedGraph*>::edge_descriptor,
bool>
add_edge(
1068 return std::make_pair(e,
true);
1077inline std::pair<boost::graph_traits<vtkMutableUndirectedGraph*>::edge_descriptor,
bool>
add_edge(
1083 return std::make_pair(e,
true);
1115template <
typename PMap>
1132template <
typename PMap>
1136 return get(helper.
pmap, key.Id);
1139template <
typename PMap>
1143 put(helper.
pmap, key.Id, value);
1150template <
typename PMap>
1167template <
typename PMap>
1174template <
typename PMap>
1207template <
typename PMap>
1224template <
typename PMap>
1231template <
typename PMap>
1249struct property_map<
vtkDirectedGraph*, vertex_index_t> : property_map<vtkGraph*, vertex_index_t>
1288 : property_map<vtkDirectedGraph*, vertex_index_t>
1294 : property_map<vtkUndirectedGraph*, vertex_index_t>
1300 : property_map<vtkDirectedGraph*, edge_index_t>
1306 : property_map<vtkUndirectedGraph*, edge_index_t>
1311#if BOOST_VERSION > 104000
1312#include <boost/property_map/vector_property_map.hpp>
1314#include <boost/vector_property_map.hpp>
property_traits< PMap >::reference reference
property_traits< PMap >::value_type value_type
property_traits< PMap >::category category
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
vtkGraphVertexPropertyMapHelper(PMap m)
property_traits< PMap >::category category
property_traits< PMap >::value_type value_type
reference operator[](const key_type &key) const
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
vtkEdgeType edge_descriptor
vtk_out_edge_pointer_iterator out_edge_iterator
vtk_in_edge_pointer_iterator in_edge_iterator
vtkGraph_traversal_category traversal_category
vtkIdType degree_size_type
static vertex_descriptor null_vertex()
adjacency_iterator_generator< vtkGraph *, vertex_descriptor, out_edge_iterator >::type adjacency_iterator
allow_parallel_edge_tag edge_parallel_category
vtkIdType vertices_size_type
vtk_vertex_iterator vertex_iterator
vtkIdType edges_size_type
vtk_edge_iterator edge_iterator
static edge_descriptor null_edge()
vtkIdType vertex_descriptor
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)