|
My Project
|
Directed Networks. More...
#include <graph.h>
Public Types | |
| typedef boost::adjacency_list < boost::setS, boost::listS, boost::directedS, boost::property < boost::vertex_name_t, lui > , boost::property < boost::edge_name_t, lui > > | 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 |
Directed Networks.
A directed graph type suitable for adding and removing vertices many times.
| typedef boost::graph_traits<graph>::edge_descriptor directed_t::edge |
Network edge
| typedef boost::graph_traits<graph>::edge_iterator directed_t::edge_iterator |
Iterator for network edges
| typedef double directed_t::edge_name_t |
Edge identifier
| typedef boost::adjacency_list<boost::setS, boost::listS, boost::directedS, boost::property<boost::vertex_name_t, lui>, boost::property<boost::edge_name_t, lui> > directed_t::graph |
Network structure
| typedef std::map<lui, vertex> directed_t::map |
ID or vertex name to vertex structure mapping
| typedef boost::graph_traits<graph>::vertex_descriptor directed_t::vertex |
Network vertex or node
| typedef lui directed_t::vertex_name_t |
vertex identifier
1.7.6.1