#include "vtkDirectedGraph.h"
#include "vtkDoubleArray.h"
#include "vtkFloatArray.h"
#include "vtkIdTypeArray.h"
#include "vtkIntArray.h"
#include "vtkMutableDirectedGraph.h"
#include "vtkMutableUndirectedGraph.h"
#include "vtkTree.h"
#include "vtkUndirectedGraph.h"
#include <stddef.h>
#include <vtksys/stl/utility>
#include <boost/config.hpp>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/adjacency_iterator.hpp>
Go to the source code of this file.
Namespaces | |
namespace | boost |
Classes | |
class | boost::vtk_vertex_iterator |
class | boost::vtk_edge_iterator |
class | boost::vtk_out_edge_pointer_iterator |
class | boost::vtk_in_edge_pointer_iterator |
struct | boost::vtkGraph_traversal_category |
struct | boost::graph_traits< vtkGraph * > |
struct | boost::graph_traits< vtkDirectedGraph * > |
struct | boost::graph_traits< const vtkDirectedGraph * > |
struct | boost::graph_traits< vtkDirectedGraph *const > |
struct | boost::graph_traits< vtkTree * > |
struct | boost::graph_traits< const vtkTree * > |
struct | boost::graph_traits< vtkTree *const > |
struct | boost::graph_traits< vtkUndirectedGraph * > |
struct | boost::graph_traits< const vtkUndirectedGraph * > |
struct | boost::graph_traits< vtkUndirectedGraph *const > |
struct | boost::graph_traits< vtkMutableDirectedGraph * > |
struct | boost::graph_traits< const vtkMutableDirectedGraph * > |
struct | boost::graph_traits< vtkMutableDirectedGraph *const > |
struct | boost::graph_traits< vtkMutableUndirectedGraph * > |
struct | boost::graph_traits< const vtkMutableUndirectedGraph * > |
struct | boost::graph_traits< vtkMutableUndirectedGraph *const > |
class | boost::vertex_property< vtkGraph * > |
class | boost::edge_property< vtkGraph * > |
struct | boost::property_traits< vtkIntArray * > |
struct | boost::property_traits< vtkGraphEdgeMap > |
class | boost::vtkGraphEdgePropertyMapHelper< PMap > |
struct | boost::vtkGraphIndexMap |
struct | boost::property_traits< vtkGraphIndexMap > |
Defines | |
#define | vtkPropertyMapMacro(T, V) |
Functions | |
int | boost::get (vtkIntArray *&arr, vtkIdType &key) |
void | boost::put (vtkIntArray *arr, vtkIdType key, const int &value) |
graph_traits< vtkGraph * > ::vertex_descriptor | boost::source (graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *) |
graph_traits< vtkGraph * > ::vertex_descriptor | boost::target (graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *) |
vtksys_stl::pair< graph_traits < vtkGraph * > ::vertex_iterator, graph_traits< vtkGraph * > ::vertex_iterator > | boost::vertices (vtkGraph *g) |
vtksys_stl::pair< graph_traits < vtkGraph * >::edge_iterator, graph_traits< vtkGraph * > ::edge_iterator > | boost::edges (vtkGraph *g) |
vtksys_stl::pair< graph_traits < vtkGraph * > ::out_edge_iterator, graph_traits< vtkGraph * > ::out_edge_iterator > | boost::out_edges (graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g) |
vtksys_stl::pair< graph_traits < vtkGraph * > ::in_edge_iterator, graph_traits< vtkGraph * > ::in_edge_iterator > | boost::in_edges (graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g) |
vtksys_stl::pair< graph_traits < vtkGraph * > ::adjacency_iterator, graph_traits< vtkGraph * > ::adjacency_iterator > | boost::adjacent_vertices (graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g) |
graph_traits< vtkGraph * > ::vertices_size_type | boost::num_vertices (vtkGraph *g) |
graph_traits< vtkGraph * > ::edges_size_type | boost::num_edges (vtkGraph *g) |
graph_traits< vtkGraph * > ::degree_size_type | boost::out_degree (graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g) |
graph_traits< vtkDirectedGraph * > ::degree_size_type | boost::in_degree (graph_traits< vtkDirectedGraph * >::vertex_descriptor u, vtkDirectedGraph *g) |
graph_traits< vtkGraph * > ::degree_size_type | boost::degree (graph_traits< vtkGraph * >::vertex_descriptor u, vtkGraph *g) |
graph_traits < vtkMutableDirectedGraph * > ::vertex_descriptor | boost::add_vertex (vtkMutableDirectedGraph *g) |
vtksys_stl::pair< graph_traits < vtkMutableDirectedGraph * > ::edge_descriptor, bool > | boost::add_edge (graph_traits< vtkMutableDirectedGraph * >::vertex_descriptor u, graph_traits< vtkMutableDirectedGraph * >::vertex_descriptor v, vtkMutableDirectedGraph *g) |
graph_traits < vtkMutableUndirectedGraph * > ::vertex_descriptor | boost::add_vertex (vtkMutableUndirectedGraph *g) |
vtksys_stl::pair< graph_traits < vtkMutableUndirectedGraph * > ::edge_descriptor, bool > | boost::add_edge (graph_traits< vtkMutableUndirectedGraph * >::vertex_descriptor u, graph_traits< vtkMutableUndirectedGraph * >::vertex_descriptor v, vtkMutableUndirectedGraph *g) |
boost::vtkPropertyMapMacro (vtkIdTypeArray, vtkIdType) vtkPropertyMapMacro(vtkDoubleArray | |
double | boost::vtkPropertyMapMacro (vtkFloatArray, float) struct vtkGraphEdgeMap |
property_traits < vtkGraphEdgeMap >::reference | boost::get (vtkGraphEdgeMap vtkNotUsed(arr), property_traits< vtkGraphEdgeMap >::key_type key) |
template<typename PMap> | |
property_traits< PMap >::reference | boost::get (vtkGraphEdgePropertyMapHelper< PMap > helper, vtkEdgeType key) |
template<typename PMap> | |
void | boost::put (vtkGraphEdgePropertyMapHelper< PMap > helper, vtkEdgeType key, const typename property_traits< PMap >::value_type &value) |
property_traits < vtkGraphIndexMap > ::reference | boost::get (vtkGraphIndexMap vtkNotUsed(arr), property_traits< vtkGraphIndexMap >::key_type key) |
#define vtkPropertyMapMacro | ( | T, | |||
V | ) |
Value:
template <> \ struct property_traits<T*> \ { \ typedef V value_type; \ typedef V reference; \ typedef vtkIdType key_type; \ typedef read_write_property_map_tag category; \ }; \ \ inline property_traits<T*>::reference \ get( \ T* const & arr, \ property_traits<T*>::key_type key) \ { \ return arr->GetValue(key); \ } \ \ inline void \ put( \ T* arr, \ property_traits<T*>::key_type key, \ const property_traits<T*>::value_type & value) \ { \ arr->InsertValue(key, value); \ }
Definition at line 515 of file vtkBoostGraphAdapter.h.