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

#include <mlGraphToBoostUndirectedGraph.h>

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

typedef ml_ug_edge	edge_descriptor
	The type for edge representative objects.

typedef undirected_tag	directed_category
	This type shall be convertible to directed_tag or undirected_tag.

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).

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

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

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.

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

Detailed Description

Definition of traits for ml::Graph class.

Definition at line 83 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 108 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 94 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 91 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 99 of file mlGraphToBoostUndirectedGraph.h.

◆ out_edge_iterator

typedef ml_ug_out_edge_iterator boost::graph_traits< ml_undirected_graph_ptr >::out_edge_iterator

Definition at line 112 of file mlGraphToBoostUndirectedGraph.h.

◆ traversal_category

typedef ml_undirected_graph_traversal_tag boost::graph_traits< ml_undirected_graph_ptr >::traversal_category

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

Definition at line 102 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 88 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 118 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 121 of file mlGraphToBoostUndirectedGraph.h.

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

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

Public Types