bidirected_t Struct Reference

Directed Network With Cycles of Size 2. More...

#include <graph.h>

List of all members.

Public Types
typedef boost::adjacency_list < boost::setS, boost::listS, boost::bidirectionalS, boost::property < boost::vertex_name_t, lui > , 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

---

Detailed Description

Directed Network With Cycles of Size 2.

A directed graph type suitable for adding and removing vertices many times.

---

Member Typedef Documentation

typedef boost::graph_traits<graph>::edge_descriptor bidirected_t::edge

Network edge

typedef boost::graph_traits<graph>::edge_iterator bidirected_t::edge_iterator

Iterator for network edges

typedef double bidirected_t::edge_name_t

Edge identifier

typedef boost::adjacency_list<boost::setS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, lui>, boost::property<boost::edge_name_t, double> > bidirected_t::graph

Network structure

typedef std::map<lui, vertex> bidirected_t::map

ID or vertex name to vertex structure mapping

typedef boost::graph_traits<graph>::vertex_descriptor bidirected_t::vertex

Network vertex or node

typedef lui bidirected_t::vertex_name_t

vertex identifier

---

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

• graph.h