MeVisLab Toolbox Reference
boost::graph_traits< ml_undirected_graph_ptr > Struct Reference

Definition of traits for ml::Graph class. More...

#include <mlGraphToBoostUndirectedGraph.h>

Public Types

typedef ml::VesselNode * vertex_descriptor
 The type for vertex representative objects. More...
 
typedef ml_ug_edge edge_descriptor
 The type for edge representative objects. More...
 
typedef undirected_tag directed_category
 This type shall be convertible to directed_tag or undirected_tag. More...
 
typedef allow_parallel_edge_tag edge_parallel_category
 This describes whether the graph class allows the insertion of parallel edges (edges with the same source and target). More...
 
typedef ml_undirected_graph_traversal_tag traversal_category
 This describes the ways in which the vertices and edges of the graph can be visited. More...
 
typedef long degree_size_type
 The unsigned intergral type used for representing the number out-edges or incident edges of a vertex. More...
 
typedef ml_ug_out_edge_iterator out_edge_iterator
 
typedef ml::Graph::NodeIterator vertex_iterator
 A vertex iterator (obtained via vertices(g)) provides access to all of the vertices in a graph. More...
 
typedef long vertices_size_type
 The unsigned integer type used to represent the number of vertices in the graph. More...
 

Detailed Description

Definition of traits for ml::Graph class.

Definition at line 85 of file mlGraphToBoostUndirectedGraph.h.

Member Typedef Documentation

◆ degree_size_type

typedef long boost::graph_traits< ml_undirected_graph_ptr >::degree_size_type

The unsigned intergral type used for representing the number out-edges or incident edges of a vertex.

Definition at line 110 of file mlGraphToBoostUndirectedGraph.h.

◆ directed_category

typedef undirected_tag boost::graph_traits< ml_undirected_graph_ptr >::directed_category

This type shall be convertible to directed_tag or undirected_tag.

Definition at line 96 of file mlGraphToBoostUndirectedGraph.h.

◆ edge_descriptor

typedef ml_ug_edge boost::graph_traits< ml_undirected_graph_ptr >::edge_descriptor

The type for edge representative objects.

Definition at line 93 of file mlGraphToBoostUndirectedGraph.h.

◆ edge_parallel_category

typedef allow_parallel_edge_tag boost::graph_traits< ml_undirected_graph_ptr >::edge_parallel_category

This describes whether the graph class allows the insertion of parallel edges (edges with the same source and target).

The two tags are allow_parallel_edge_tag and disallow_parallel_edge_tag.

Definition at line 101 of file mlGraphToBoostUndirectedGraph.h.

◆ out_edge_iterator

Definition at line 114 of file mlGraphToBoostUndirectedGraph.h.

◆ traversal_category

This describes the ways in which the vertices and edges of the graph can be visited.

Definition at line 104 of file mlGraphToBoostUndirectedGraph.h.

◆ vertex_descriptor

typedef ml::VesselNode* boost::graph_traits< ml_undirected_graph_ptr >::vertex_descriptor

The type for vertex representative objects.

Definition at line 90 of file mlGraphToBoostUndirectedGraph.h.

◆ vertex_iterator

typedef ml::Graph::NodeIterator boost::graph_traits< ml_undirected_graph_ptr >::vertex_iterator

A vertex iterator (obtained via vertices(g)) provides access to all of the vertices in a graph.

Definition at line 120 of file mlGraphToBoostUndirectedGraph.h.

◆ vertices_size_type

typedef long boost::graph_traits< ml_undirected_graph_ptr >::vertices_size_type

The unsigned integer type used to represent the number of vertices in the graph.

Definition at line 123 of file mlGraphToBoostUndirectedGraph.h.


The documentation for this struct was generated from the following file: