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

#include <mlGraphToBoostGraph.h>

Public Types
typedef ml::VesselNode *	vertex_descriptor
	The type for vertex representative objects. More...

typedef ml::VesselEdge *	edge_descriptor
	The type for edge representative objects. More...

typedef directed_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_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_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 63 of file mlGraphToBoostGraph.h.

Member Typedef Documentation

◆ degree_size_type

typedef long boost::graph_traits< ml_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 88 of file mlGraphToBoostGraph.h.

◆ directed_category

typedef directed_tag boost::graph_traits< ml_graph_ptr >::directed_category

This type shall be convertible to directed_tag or undirected_tag.

Definition at line 74 of file mlGraphToBoostGraph.h.

◆ edge_descriptor

typedef ml::VesselEdge* boost::graph_traits< ml_graph_ptr >::edge_descriptor

The type for edge representative objects.

Definition at line 71 of file mlGraphToBoostGraph.h.

◆ edge_parallel_category

typedef allow_parallel_edge_tag boost::graph_traits< ml_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 79 of file mlGraphToBoostGraph.h.

◆ out_edge_iterator

typedef ml_out_edge_iterator boost::graph_traits< ml_graph_ptr >::out_edge_iterator

Definition at line 92 of file mlGraphToBoostGraph.h.

◆ traversal_category

typedef ml_graph_traversal_tag boost::graph_traits< ml_graph_ptr >::traversal_category

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

Definition at line 82 of file mlGraphToBoostGraph.h.

◆ vertex_descriptor

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

The type for vertex representative objects.

Definition at line 68 of file mlGraphToBoostGraph.h.

◆ vertex_iterator

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

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

Definition at line 98 of file mlGraphToBoostGraph.h.

◆ vertices_size_type

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

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

Definition at line 101 of file mlGraphToBoostGraph.h.

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

MeVisLab/Standard/Sources/Shared/MLGraphUtilities/private/mlGraphToBoostGraph.h

Public Types