- Generated by
1.9.1
|
MeVisLab Toolbox Reference
|
Forward declaration for the boost::mutex class. More...
Classes | |
| struct | ml_graph_traversal_tag |
| This describes the ways in which the vertices and edges of the graph can be visited. More... | |
| struct | graph_traits< ml_graph_ptr > |
| Definition of traits for ml::Graph class. More... | |
| class | ml_vertex_id_map |
| Vertex id Maps each vertex to a unique id. More... | |
| struct | property_map< ml_graph_ptr, vertex_index_t > |
| class | ml_edge_weight_map |
| struct | property_map< ml_graph_ptr, edge_weight_t > |
| class | ml_iterator_map |
| This is a helper template to create an external property map for an std random access container. More... | |
| struct | ml_undirected_graph_traversal_tag |
| This describes the ways in which the vertices and edges of the graph can be visited. More... | |
| struct | graph_traits< ml_undirected_graph_ptr > |
| Definition of traits for ml::Graph class. More... | |
| class | ml_ug_edge |
| Simple wrapper to store an ml::VesselEdge together with a ml::VesselNode, so that the source() function and the out_edge_iterator will always be able to return an edge which points away from a vertex. More... | |
| class | ml_ug_vertex_id_map |
| Vertex id Maps each vertex to a unique id. More... | |
| struct | property_map< ml_undirected_graph_ptr, vertex_index_t > |
| class | ml_ug_edge_weight_map |
| struct | property_map< ml_undirected_graph_ptr, edge_weight_t > |
Functions | |
| boost::graph_traits< ml_graph_ptr >::vertex_descriptor | source (graph_traits< ml_graph_ptr >::edge_descriptor e, const ml_graph_ptr) |
| Returns the vertex descriptor for u of the edge (u,v) represented by e. More... | |
| boost::graph_traits< ml_graph_ptr >::vertex_descriptor | target (graph_traits< ml_graph_ptr >::edge_descriptor e, const ml_graph_ptr) |
| Returns the vertex descriptor for v of the edge (u,v) represented by e. More... | |
| std::pair< boost::graph_traits< ml_graph_ptr >::out_edge_iterator, boost::graph_traits< ml_graph_ptr >::out_edge_iterator > | out_edges (boost::graph_traits< ml_graph_ptr >::vertex_descriptor vertex, const ml_graph_ptr) |
| Returns an iterator-range providing access to the out-edges (for directed graphs) or incident edges (for undirected graphs) of vertex u in graph g. More... | |
| boost::graph_traits< ml_graph_ptr >::degree_size_type | out_degree (boost::graph_traits< ml_graph_ptr >::vertex_descriptor vertex, const ml_graph_ptr) |
| Returns the number of out-edges (for directed graphs) or the number of incident edges (for undirected graphs) of vertex u in graph g. More... | |
| std::pair< boost::graph_traits< ml_graph_ptr >::vertex_iterator, boost::graph_traits< ml_graph_ptr >::vertex_iterator > | vertices (ml_graph_ptr g) |
| Returns an iterator-range providing access to all the vertices in the graph g. More... | |
| boost::graph_traits< ml_graph_ptr >::vertices_size_type | num_vertices (const ml_graph_ptr g) |
| Returns the number of vertices in the graph g. More... | |
| boost::graph_traits< ml_graph_ptr >::vertex_descriptor | vertex (boost::graph_traits< ml_graph_ptr >::degree_size_type arrayIndex, const ml_graph_ptr g) |
| Returns the vertex at internal index. More... | |
| ml_vertex_id_map | get (vertex_index_t, ml_graph_ptr g) |
| get() function for vertex id property map vertex_index_t just necessary for overloading More... | |
| ml_edge_weight_map | get (edge_weight_t, ml_graph_ptr) |
| template<class IteratorTraits , class IDMap > | |
| IteratorTraits::value_type | get (const ml_iterator_map< IteratorTraits, IDMap > &i, typename property_traits< IDMap >::key_type key) |
| template<class IteratorTraits , class IDMap > | |
| void | put (const ml_iterator_map< IteratorTraits, IDMap > &i, typename property_traits< IDMap >::key_type key, const typename IteratorTraits::value_type &value) |
| template<class IteratorTraits , class IDMap > | |
| IteratorTraits::value_type & | at (const ml_iterator_map< IteratorTraits, IDMap > &i, typename property_traits< IDMap >::key_type key) |
| boost::graph_traits< ml_undirected_graph_ptr >::vertex_descriptor | source (graph_traits< ml_undirected_graph_ptr >::edge_descriptor e, const ml_undirected_graph_ptr) |
| Returns the vertex descriptor for u of the edge (u,v) represented by e. More... | |
| boost::graph_traits< ml_undirected_graph_ptr >::vertex_descriptor | target (graph_traits< ml_undirected_graph_ptr >::edge_descriptor e, const ml_undirected_graph_ptr) |
| Returns the vertex descriptor for v of the edge (u,v) represented by e. More... | |
| std::pair< boost::graph_traits< ml_undirected_graph_ptr >::out_edge_iterator, boost::graph_traits< ml_undirected_graph_ptr >::out_edge_iterator > | out_edges (boost::graph_traits< ml_undirected_graph_ptr >::vertex_descriptor vertex, const ml_undirected_graph_ptr) |
| Returns an iterator-range providing access to the out-edges (for directed graphs) or incident edges (for undirected graphs) of vertex u in graph g. More... | |
| boost::graph_traits< ml_undirected_graph_ptr >::degree_size_type | out_degree (boost::graph_traits< ml_undirected_graph_ptr >::vertex_descriptor vertex, const ml_undirected_graph_ptr) |
| Returns the number of out-edges (for directed graphs) or the number of incident edges (for undirected graphs) of vertex u in graph g. More... | |
| std::pair< boost::graph_traits< ml_undirected_graph_ptr >::vertex_iterator, boost::graph_traits< ml_undirected_graph_ptr >::vertex_iterator > | vertices (ml_undirected_graph_ptr g) |
| Returns an iterator-range providing access to all the vertices in the graph g. More... | |
| boost::graph_traits< ml_undirected_graph_ptr >::vertices_size_type | num_vertices (const ml_undirected_graph_ptr g) |
| Returns the number of vertices in the graph g. More... | |
| boost::graph_traits< ml_undirected_graph_ptr >::vertex_descriptor | vertex (boost::graph_traits< ml_undirected_graph_ptr >::degree_size_type arrayIndex, const ml_undirected_graph_ptr g) |
| Returns the vertex at internal index. More... | |
| ml_ug_vertex_id_map | get (vertex_index_t, ml_undirected_graph_ptr g) |
| get() function for vertex id property map vertex_index_t just necessary for overloading More... | |
| ml_ug_edge_weight_map | get (edge_weight_t, ml_undirected_graph_ptr) |
Forward declaration for the boost::mutex class.
| IteratorTraits::value_type& boost::at | ( | const ml_iterator_map< IteratorTraits, IDMap > & | i, |
| typename property_traits< IDMap >::key_type | key | ||
| ) |
Definition at line 422 of file mlGraphToBoostGraph.h.
References boost::ml_iterator_map< IteratorTraits, IDMap >::m_id, and boost::ml_iterator_map< IteratorTraits, IDMap >::m_iter.
Referenced by ml::WEMContainer< T >::at(), ml::WEMHeap< T >::clear(), ml::WEMContainer< T >::destroy(), ml::WEMFastVector< T >::first(), ml::WEMIndexVector< T >::first(), ml::WEMVector< T, fixedBufferSize >::first(), ml::CSOObjectVector< T >::first(), ml::WEMFastVector< T >::last(), ml::WEMVector< T, fixedBufferSize >::last(), ml::CSOObjectVector< T >::last(), ml::CSOObjectVector< T >::lookup(), ml::WEMFastVector< T >::lookup(), ml::WEMIndexVector< T >::remove(), ml::WEMContainer< T >::remove(), ml::WEMHeap< T >::remove(), ml::WEMIndexVector< T >::reorder(), ml::WEMHeap< T >::sort(), ml::WEMContainer< T >::swap(), and ml::WEMHeap< T >::swap().
| IteratorTraits::value_type boost::get | ( | const ml_iterator_map< IteratorTraits, IDMap > & | i, |
| typename property_traits< IDMap >::key_type | key | ||
| ) |
Definition at line 405 of file mlGraphToBoostGraph.h.
References boost::ml_iterator_map< IteratorTraits, IDMap >::m_id, and boost::ml_iterator_map< IteratorTraits, IDMap >::m_iter.
|
inline |
Definition at line 331 of file mlGraphToBoostGraph.h.
|
inline |
Definition at line 371 of file mlGraphToBoostUndirectedGraph.h.
|
inline |
get() function for vertex id property map vertex_index_t just necessary for overloading
Definition at line 298 of file mlGraphToBoostGraph.h.
Referenced by ml::MessagingBackgroundTask::callMethodOnGUI(), SoShadowRenderElement::get(), and scl::remove_log().
|
inline |
get() function for vertex id property map vertex_index_t just necessary for overloading
Definition at line 337 of file mlGraphToBoostUndirectedGraph.h.
|
inline |
Returns the number of vertices in the graph g.
Definition at line 256 of file mlGraphToBoostGraph.h.
|
inline |
Returns the number of vertices in the graph g.
Definition at line 294 of file mlGraphToBoostUndirectedGraph.h.
|
inline |
Returns the number of out-edges (for directed graphs) or the number of incident edges (for undirected graphs) of vertex u in graph g.
Return type: degree_size_type
Definition at line 223 of file mlGraphToBoostGraph.h.
References vertex().
|
inline |
Returns the number of out-edges (for directed graphs) or the number of incident edges (for undirected graphs) of vertex u in graph g.
Return type: degree_size_type
Definition at line 274 of file mlGraphToBoostUndirectedGraph.h.
References vertex().
|
inline |
Returns an iterator-range providing access to the out-edges (for directed graphs) or incident edges (for undirected graphs) of vertex u in graph g.
The source vertex of an edge obtained via an out edge iterator is guaranteed (for both directed and undirected graphs) to be the vertex u used in the call to out_edges(u, g) and the target vertex must the a vertex adjacent to u. For undirected graphs, the edge (u,v) is the same as edge (v,u), so without some extra guarantee an implementation would be free use any ordering for the pair of vertices in an out-edge. For example, if you call out_edges(u, g), and v is one of the vertices adjacent to u, then the implementation would be free to return (v,u) as an out-edge which would be non-intuitive and cause trouble for algorithms. Therefore, the extra requirement is added that the out-edge connecting u and v must be given as (u,v) and not (v,u). Return type: std::pair<out_edge_iterator, out_edge_iterator>
Definition at line 210 of file mlGraphToBoostGraph.h.
References vertex().
|
inline |
Returns an iterator-range providing access to the out-edges (for directed graphs) or incident edges (for undirected graphs) of vertex u in graph g.
The source vertex of an edge obtained via an out edge iterator is guaranteed (for both directed and undirected graphs) to be the vertex u used in the call to out_edges(u, g) and the target vertex must a vertex adjacent to u. For undirected graphs, the edge (u,v) is the same as edge (v,u), so without some extra guarantee an implementation would be free use any ordering for the pair of vertices in an out-edge. For example, if you call out_edges(u, g), and v is one of the vertices adjacent to u, then the implementation would be free to return (v,u) as an out-edge which would be non-intuitive and cause trouble for algorithms. Therefore, the extra requirement is added that the out-edge connecting u and v must be given as (u,v) and not (v,u). Return type: std::pair<out_edge_iterator, out_edge_iterator>
Definition at line 261 of file mlGraphToBoostUndirectedGraph.h.
References vertex().
| void boost::put | ( | const ml_iterator_map< IteratorTraits, IDMap > & | i, |
| typename property_traits< IDMap >::key_type | key, | ||
| const typename IteratorTraits::value_type & | value | ||
| ) |
Definition at line 412 of file mlGraphToBoostGraph.h.
References boost::ml_iterator_map< IteratorTraits, IDMap >::m_id, and boost::ml_iterator_map< IteratorTraits, IDMap >::m_iter.
|
inline |
Returns the vertex descriptor for u of the edge (u,v) represented by e.
Definition at line 182 of file mlGraphToBoostGraph.h.
Referenced by ml::WEMPrimitiveValueList::addValueFrom(), DCMTree_Serialization::deserialize(), DCMTree_Serialization::deserializeEnumX(), DCMTree_Serialization::deserializeIntoExistingX(), DCMTree_Serialization::deserializeIntoNewX(), DCMTree_Serialization::deserializePrimitiveX(), DCMTree_Serialization::deserializeX(), ml::MLTStdTypeInfos< VTYP >::MLTYPE_arrayCopy(), ml::MLTStdTypeInfos< VTYP >::MLTYPE_arrayCopyWithStrides(), ml::MLTStdTypeInfos< VTYP >::MLTYPE_arrayRescale(), ml::MLTStdTypeInfos< VTYP >::MLTYPE_copy(), ml::ItemModelEvent::model(), asio::ProcessorConnection< ParameterPack< Args... > >::ProcessorConnection(), and ml::WEMPrimitiveValueList::setValueFrom().
|
inline |
Returns the vertex descriptor for u of the edge (u,v) represented by e.
Definition at line 233 of file mlGraphToBoostUndirectedGraph.h.
|
inline |
Returns the vertex descriptor for v of the edge (u,v) represented by e.
Definition at line 190 of file mlGraphToBoostGraph.h.
Referenced by ml::MessagingBackgroundTask::callMethodOnGUI(), asio::ObservableConnection< Result, Args >::ObservableConnection(), asio::ObservableConnection< void, Args... >::ObservableConnection(), asio::ObservableConnection< Result >::ObservableConnection(), asio::ObservableConnection< void >::ObservableConnection(), and asio::ProcessorConnection< ParameterPack< Args... > >::ProcessorConnection().
|
inline |
Returns the vertex descriptor for v of the edge (u,v) represented by e.
Definition at line 241 of file mlGraphToBoostUndirectedGraph.h.
|
inline |
Returns the vertex at internal index.
Definition at line 264 of file mlGraphToBoostGraph.h.
Referenced by boost::ml_vertex_id_map::operator[](), boost::ml_ug_vertex_id_map::operator[](), out_degree(), and out_edges().
|
inline |
Returns the vertex at internal index.
Definition at line 302 of file mlGraphToBoostUndirectedGraph.h.
|
inline |
Returns an iterator-range providing access to all the vertices in the graph g.
Definition at line 248 of file mlGraphToBoostGraph.h.
|
inline |
Returns an iterator-range providing access to all the vertices in the graph g.
Definition at line 286 of file mlGraphToBoostUndirectedGraph.h.
1.9.1