mlGraphToBoostGraph.h File Reference

#include <iterator>
#include <boost/operators.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/property_map/property_map.hpp>
#include "mlGraphComponents.h"
#include "mlGraph.h"
#include <mlVesselEdge.h>

Go to the source code of this file.

Classes
struct	boost::ml_graph_traversal_tag
	This describes the ways in which the vertices and edges of the graph can be visited. More...
struct	boost::graph_traits< ml_graph_ptr >
	Definition of traits for ml::Graph class. More...
class	ml_out_edge_iterator
class	boost::ml_vertex_id_map
	Vertex id Maps each vertex to a unique id. More...
struct	boost::property_map< ml_graph_ptr, vertex_index_t >
class	boost::ml_edge_weight_map
struct	boost::property_map< ml_graph_ptr, edge_weight_t >
struct	broken_VC_ptr_traits< T, ValueType >
	Since the correct std::iterator_traits rely on partial template specialization which is not supported by VC6 we must use a special traits class to get value_type correct. More...
class	boost::ml_iterator_map< IteratorTraits, IDMap >
	This is a helper template to create an external property map for an std random access container. More...

Namespaces
namespace	boost
	Forward declaration for the boost::mutex class.

Typedefs
typedef ml::Graph *	ml_graph_ptr
	typedef for use with graph_traits<>

Functions
boost::graph_traits< ml_graph_ptr >::vertex_descriptor	boost::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.
boost::graph_traits< ml_graph_ptr >::vertex_descriptor	boost::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.
std::pair< boost::graph_traits< ml_graph_ptr >::out_edge_iterator, boost::graph_traits< ml_graph_ptr >::out_edge_iterator >	boost::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.
boost::graph_traits< ml_graph_ptr >::degree_size_type	boost::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.
std::pair< boost::graph_traits< ml_graph_ptr >::vertex_iterator, boost::graph_traits< ml_graph_ptr >::vertex_iterator >	boost::vertices (ml_graph_ptr g)
	Returns an iterator-range providing access to all the vertices in the graph g.
boost::graph_traits< ml_graph_ptr >::vertices_size_type	boost::num_vertices (const ml_graph_ptr g)
	Returns the number of vertices in the graph g.
boost::graph_traits< ml_graph_ptr >::vertex_descriptor	boost::vertex (boost::graph_traits< ml_graph_ptr >::degree_size_type arrayIndex, const ml_graph_ptr g)
	Returns the vertex at internal index.
ml_vertex_id_map	boost::get (vertex_index_t, ml_graph_ptr g)
	get() function for vertex id property map vertex_index_t just necessary for overloading
ml_edge_weight_map	boost::get (edge_weight_t, ml_graph_ptr)
template<class IteratorTraits , class IDMap >
IteratorTraits::value_type	boost::get (const ml_iterator_map< IteratorTraits, IDMap > &i, typename property_traits< IDMap >::key_type key)
template<class IteratorTraits , class IDMap >
void	boost::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 &	boost::at (const ml_iterator_map< IteratorTraits, IDMap > &i, typename property_traits< IDMap >::key_type key)

Typedef Documentation

ml_graph_ptr

typedef ml::Graph* ml_graph_ptr

typedef for use with graph_traits<>

Definition at line 39 of file mlGraphToBoostGraph.h.