My Project
|
Undirected Networks. More...
#include <graph.h>
Public Types | |
typedef boost::adjacency_list < boost::setS, boost::vecS, boost::undirectedS, boost::property < boost::vertex_name_t, double > , boost::property < boost::edge_name_t, double > > | graph |
typedef boost::graph_traits < graph >::vertex_descriptor | vertex |
typedef boost::graph_traits < graph >::edge_descriptor | edge |
typedef boost::graph_traits < graph >::edge_iterator | edge_iterator |
typedef std::map< lui, vertex > | map |
typedef double | edge_name_t |
typedef lui | vertex_name_t |
Undirected Networks.
An undirected graph type suitable for connected_components
typedef boost::graph_traits<graph>::edge_descriptor undirected_t::edge |
Network edge
typedef boost::graph_traits<graph>::edge_iterator undirected_t::edge_iterator |
Iterator for network edges
typedef double undirected_t::edge_name_t |
Edge identifier
typedef boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_name_t, double>, boost::property<boost::edge_name_t, double> > undirected_t::graph |
Network structure
typedef std::map<lui, vertex> undirected_t::map |
ID or vertex name to vertex structure mapping
typedef boost::graph_traits<graph>::vertex_descriptor undirected_t::vertex |
Network vertex or node
typedef lui undirected_t::vertex_name_t |
vertex identifier