STAPL API Reference          
Overview   Containers   Algorithms   Views   Skeletons   Run-Time System
Modules     Classes    
Classes | Functions
bgl_directed_graph_adapter.hpp File Reference
+ Include dependency graph for bgl_directed_graph_adapter.hpp:

Classes

struct  boost::stapl_graph_traversal_category
 Struct to tag various traversal categories for graph algorithms. More...
 
struct  boost::graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >
 BGL-style traits class for the STAPL sequential graph. More...
 
struct  boost::graph_traits< stapl::sequential::directed_preds_graph< stapl::MULTIEDGES, VertexProperty, EdgeProperty > >
 Specialization of boost::graph_traits for STAPL sequential directed_preds_graph. More...
 
class  boost::stapl_graph_id_map< VertexProperty, EdgeProperty >
 Vertex property map for BGL that returns identity. More...
 
class  boost::stapl_graph_edge_id_map< VertexProperty, EdgeProperty >
 Edge property map for BGL that returns identity (edge-id). More...
 
struct  boost::stapl_property_map< Tag >
 Class for property map over STAPL sequential graph. More...
 
struct  boost::stapl_property_map< vertex_index_t >
 Specialization of stapl_property_map for vertex indices. More...
 
struct  boost::stapl_property_map< edge_index_t >
 Specialization of stapl_property_map for edge indices. More...
 
class  boost::stapl_graph_data_map< Data, DataRef, GraphPtr >
 Class for property map over STAPL sequential graph.Returns a reference to the value stored on the vertex of the graph. More...
 
struct  boost::stapl_property_map< vertex_all_t >
 Specialization of stapl_property_map for vertices, using stored data. More...
 
struct  boost::stapl_property_map< edge_all_t >
 Specialization of stapl_property_map for all edges. More...
 

Functions

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor boost::vertex (int v_int_id, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the v_int_id-th vertex in the specified graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor boost::source (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::edge_descriptor e, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the vertex descriptor of the source vertex of the specified edge in the provided graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor boost::target (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::edge_descriptor e, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the vertex descriptor of the target vertex of the specified edge in the provided graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_iterator, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_iterator > boost::vertices (const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns a pair of iterators over the vertices of the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::edge_iterator, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::edge_iterator > boost::edges (const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns a pair of iterators over the edges of the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::out_edge_iterator, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::out_edge_iterator > boost::out_edges (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor u, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns a pair of iterators over the out-edges of the specified vertex in the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::in_edge_iterator, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::in_edge_iterator > boost::in_edges (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor u, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns a pair of iterators over the in-edges of the specified vertex in the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::adjacency_iterator, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::adjacency_iterator > boost::adjacent_vertices (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor u, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns a pair of iterators over the adjacents of the specified vertex in the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertices_size_type boost::num_vertices (const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the number of vertices in the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::edges_size_type boost::num_edges (const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the number of edges in the specified STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::degree_size_type boost::out_degree (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor u, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the number of out-edges of the specified vertex in the input STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::degree_size_type boost::in_degree (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor u, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the number of in-edges of the specified vertex in the input STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::directed_preds_graph< stapl::MULTIEDGES, VertexProperty, EdgeProperty > >::degree_size_type boost::in_degree (typename graph_traits< stapl::sequential::directed_preds_graph< stapl::MULTIEDGES, VertexProperty, EdgeProperty > >::vertex_descriptor u, const stapl::sequential::directed_preds_graph< stapl::MULTIEDGES, VertexProperty, EdgeProperty > &g)
 Returns the number of in-edges of the specified vertex in the input STAPL sequential direct_pred_graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::degree_size_type boost::degree (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor u, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Returns the number of edges of the specified vertex in the input STAPL sequential graph. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor boost::add_vertex (stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Adds a vertex to the specified graph, returning its descriptor. Uses default property. More...
 
template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor boost::add_vertex (const VertexProperty &vp, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Adds a vertex with the specified property to the specified graph, returning its descriptor. More...
 
template<typename VertexProperty , typename EdgeProperty >
void boost::clear_vertex (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor u, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Deletes all edges to and from the specified vertex. More...
 
template<typename VertexProperty , typename EdgeProperty >
void boost::remove_vertex (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor u, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Deletes the specified vertex. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::edge_descriptor, bool > boost::add_edge (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor u, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor v, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Adds an edge between two specified vertices. More...
 
template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::edge_descriptor, bool > boost::add_edge (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor u, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor v, const EdgeProperty &et, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Adds an edge with the given property between two specified vertices. More...
 
template<typename VertexProperty , typename EdgeProperty >
void boost::remove_edge (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor u, typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor v, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Deletes the edge with between the two specified verticesi. More...
 
template<typename VertexProperty , typename EdgeProperty >
void boost::remove_edge (typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::edge_descriptor e, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Deletes the edge with the specified edge descriptor. More...
 
template<typename VertexProperty , typename EdgeProperty >
stapl_graph_id_map< VertexProperty, EdgeProperty > boost::get (vertex_index_t, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the identity vertex property map associated with the specified graph, based on vertex descriptors, i.e., the property map returns the vertex descriptor as the property. More...
 
template<typename VertexProperty , typename EdgeProperty >
stapl_graph_id_map< VertexProperty, EdgeProperty > boost::get (edge_index_t, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the identity edge property map associated with the specified graph, based on edge-indices, i.e., the property map returns the edge-index as the property. More...
 
template<typename VertexProperty , typename EdgeProperty >
stapl_graph_edge_id_map< VertexProperty, EdgeProperty > boost::get (edge_weight_t, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the identity edge property map associated with the specified graph, based on edge-weights, i.e., the property map returns the edge-weight as the property. More...
 
template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > >, vertex_all_t >::type boost::get (vertex_all_t, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the stored vertex property map associated with the specified graph, i.e., the property map returns the data stored corresponding to each vertex as the property. More...
 
template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > >, vertex_all_t >::const_type boost::get (vertex_all_t, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the stored vertex property map associated with the specified const graph, i.e., the property map returns the data stored corresponding to each vertex as the property. More...
 
template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > >, edge_all_t >::type boost::get (edge_all_t, stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the stored edge property map associated with the specified graph, i.e., the property map returns the data stored corresponding to each edge as the property. More...
 
template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > >, edge_all_t >::const_type boost::get (edge_all_t, const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &g)
 Function to get the stored edge property map associated with the specified const graph, i.e., the property map returns the data stored corresponding to each edge as the property. More...
 

Detailed Description

This file provides BGL-style wrapper functions for the STAPL sequential graph to allow users to call BGL algorithms on it. The functions in this file are specialized for the Directed graph. For Undirected graphs, please refer to bgl_undirected_graph_adapter.hpp.

The functions and classes in this file allows the user to treat a STAPL GRAPH object as a boost graph "as is". No wrapper is needed for the GRAPH object.

Note
Include this header file before any Boost algorithm files.
Warning
This implementation relies on partial specialization for the graph_traits class (so it won't compile with Visual C++).

Function Documentation

◆ vertex()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_descriptor boost::vertex ( int  v_int_id,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns the v_int_id-th vertex in the specified graph.

Parameters
v_int_idThe position, from start of graph, of the vertex of interest.
gA STAPL sequential graph.
Returns
The vertex_descriptor of the vertex at the specified position from the start of the graph, in graph g.

◆ source()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_descriptor boost::source ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::edge_descriptor  e,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns the vertex descriptor of the source vertex of the specified edge in the provided graph.

Parameters
eThe descriptor of the specified edge of a STAPL sequential graph.
gA STAPL sequential graph.
Returns
The vertex_descriptor of the source vertex of the specified edge.

◆ target()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_descriptor boost::target ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::edge_descriptor  e,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns the vertex descriptor of the target vertex of the specified edge in the provided graph.

Parameters
eThe descriptor of the specified edge of a STAPL sequential graph.
gA STAPL sequential graph.
Returns
The vertex_descriptor of the target vertex of the specified edge.

◆ vertices()

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_iterator, typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_iterator> boost::vertices ( const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g)

Returns a pair of iterators over the vertices of the specified STAPL sequential graph.

Parameters
gA STAPL sequential graph.
Returns
A pair of iterators over the vertices of the input graph. The first of the pair points to the start vertex of the graph, while the second of the pair points to one-past the end vertex of the graph.

◆ edges()

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::edge_iterator, typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::edge_iterator> boost::edges ( const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g)

Returns a pair of iterators over the edges of the specified STAPL sequential graph.

Parameters
gA STAPL sequential graph.
Returns
A pair of iterators over the edges of the input graph. The first of the pair points to the start edge of the graph, while the second of the pair points to one-past the end edge of the graph.

◆ out_edges()

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::out_edge_iterator, typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::out_edge_iterator> boost::out_edges ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  u,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns a pair of iterators over the out-edges of the specified vertex in the specified STAPL sequential graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential graph.
Returns
A pair of iterators over the out-edges of the specified vertex of the input graph. The first of the pair points to the start out-edge of the vertex, while the second of the pair points to one-past the end out-edge of the vertex.

◆ in_edges()

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::in_edge_iterator, typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::in_edge_iterator> boost::in_edges ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor  u,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns a pair of iterators over the in-edges of the specified vertex in the specified STAPL sequential graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential graph.
Returns
A pair of iterators over the in-edges of the specified vertex of the input graph. The first of the pair points to the start in-edge of the vertex, while the second of the pair points to one-past the end in-edge of the vertex.

◆ adjacent_vertices()

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::adjacency_iterator, typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::adjacency_iterator> boost::adjacent_vertices ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor  u,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns a pair of iterators over the adjacents of the specified vertex in the specified STAPL sequential graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential graph.
Returns
A pair of iterators over the adjacents of the specified vertex of the input graph. The first of the pair points to the start adjacent of the vertex, while the second of the pair points to one-past the end adjacent of the vertex.

◆ num_vertices()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertices_size_type boost::num_vertices ( const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g)

Returns the number of vertices in the specified STAPL sequential graph.

Parameters
gA STAPL sequential graph.

◆ num_edges()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::edges_size_type boost::num_edges ( const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g)

Returns the number of edges in the specified STAPL sequential graph.

Parameters
gA STAPL sequential graph.

◆ out_degree()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::degree_size_type boost::out_degree ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  u,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns the number of out-edges of the specified vertex in the input STAPL sequential graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential graph.
Returns
The number of out-edges of the specified vertex in the input graph.

◆ in_degree() [1/2]

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::degree_size_type boost::in_degree ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor  u,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns the number of in-edges of the specified vertex in the input STAPL sequential graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential graph.
Returns
The number of in-edges of the specified vertex in the input graph.

◆ in_degree() [2/2]

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::directed_preds_graph<stapl::MULTIEDGES, VertexProperty, EdgeProperty> >::degree_size_type boost::in_degree ( typename graph_traits< stapl::sequential::directed_preds_graph< stapl::MULTIEDGES, VertexProperty, EdgeProperty > >::vertex_descriptor  u,
const stapl::sequential::directed_preds_graph< stapl::MULTIEDGES, VertexProperty, EdgeProperty > &  g 
)

Returns the number of in-edges of the specified vertex in the input STAPL sequential direct_pred_graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential direct_pred_graph.
Returns
The number of in-edges of the specified vertex in the input graph.

◆ degree()

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::degree_size_type boost::degree ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor  u,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Returns the number of edges of the specified vertex in the input STAPL sequential graph.

Parameters
uThe vertex descriptor of the specified vertex.
gA STAPL sequential graph.
Returns
The number of edges of the specified vertex in the input graph.

◆ add_vertex() [1/2]

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_descriptor boost::add_vertex ( stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g)

Adds a vertex to the specified graph, returning its descriptor. Uses default property.

Parameters
gA STAPL sequential graph.
Returns
The descriptor of the added vertex.

◆ add_vertex() [2/2]

template<typename VertexProperty , typename EdgeProperty >
graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::vertex_descriptor boost::add_vertex ( const VertexProperty &  vp,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Adds a vertex with the specified property to the specified graph, returning its descriptor.

Parameters
vpThe vertex property of the vertex to be added.
gA STAPL sequential graph.
Returns
The descriptor of the added vertex.

◆ clear_vertex()

template<typename VertexProperty , typename EdgeProperty >
void boost::clear_vertex ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > >::vertex_descriptor  u,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Deletes all edges to and from the specified vertex.

Parameters
uThe descriptor of the vertex.
gA STAPL sequential graph.

◆ remove_vertex()

template<typename VertexProperty , typename EdgeProperty >
void boost::remove_vertex ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  u,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Deletes the specified vertex.

Parameters
uThe descriptor of the vertex.
gA STAPL sequential graph.

◆ add_edge() [1/2]

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::edge_descriptor, bool> boost::add_edge ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  u,
typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  v,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Adds an edge between two specified vertices.

Parameters
uThe descriptor of the source vertex.
vThe descriptor of the target vertex.
gA STAPL sequential graph.
Returns
pair<edge_descriptor, bool> Edge descriptor is the added edge and the bool is true if the edge was added, or false otherwise.

◆ add_edge() [2/2]

template<typename VertexProperty , typename EdgeProperty >
std::pair< typename graph_traits< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> > >::edge_descriptor, bool> boost::add_edge ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  u,
typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  v,
const EdgeProperty &  et,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Adds an edge with the given property between two specified vertices.

Parameters
uThe descriptor of the source vertex.
vThe descriptor of the target vertex.
etThe property of the edge.
gA STAPL sequential graph.
Returns
pair<edge_descriptor, bool> Edge descriptor is the added edge and the bool is true if the edge was added, or false otherwise.

◆ remove_edge() [1/2]

template<typename VertexProperty , typename EdgeProperty >
void boost::remove_edge ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  u,
typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::vertex_descriptor  v,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Deletes the edge with between the two specified verticesi.

Parameters
uThe descriptor of the source vertex.
vThe descriptor of the target vertex.
gA STAPL sequential graph.

◆ remove_edge() [2/2]

template<typename VertexProperty , typename EdgeProperty >
void boost::remove_edge ( typename graph_traits< stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > > ::edge_descriptor  e,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Deletes the edge with the specified edge descriptor.

Parameters
eThe descriptor of the edge.
gA STAPL sequential graph.

◆ get() [1/7]

template<typename VertexProperty , typename EdgeProperty >
stapl_graph_id_map<VertexProperty, EdgeProperty> boost::get ( vertex_index_t  ,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the identity vertex property map associated with the specified graph, based on vertex descriptors, i.e., the property map returns the vertex descriptor as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.

◆ get() [2/7]

template<typename VertexProperty , typename EdgeProperty >
stapl_graph_id_map<VertexProperty, EdgeProperty> boost::get ( edge_index_t  ,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the identity edge property map associated with the specified graph, based on edge-indices, i.e., the property map returns the edge-index as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.

◆ get() [3/7]

template<typename VertexProperty , typename EdgeProperty >
stapl_graph_edge_id_map<VertexProperty, EdgeProperty> boost::get ( edge_weight_t  ,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the identity edge property map associated with the specified graph, based on edge-weights, i.e., the property map returns the edge-weight as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.

◆ get() [4/7]

template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> >, vertex_all_t>::type boost::get ( vertex_all_t  ,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the stored vertex property map associated with the specified graph, i.e., the property map returns the data stored corresponding to each vertex as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.

◆ get() [5/7]

template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> >, vertex_all_t>::const_type boost::get ( vertex_all_t  ,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the stored vertex property map associated with the specified const graph, i.e., the property map returns the data stored corresponding to each vertex as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.

◆ get() [6/7]

template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> >, edge_all_t>::type boost::get ( edge_all_t  ,
stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the stored edge property map associated with the specified graph, i.e., the property map returns the data stored corresponding to each edge as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.

◆ get() [7/7]

template<typename VertexProperty , typename EdgeProperty >
property_map< stapl::sequential::graph<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits<stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty> >, edge_all_t>::const_type boost::get ( edge_all_t  ,
const stapl::sequential::graph< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty, stapl::sequential::adj_graph_traits< stapl::DIRECTED, stapl::MULTIEDGES, VertexProperty, EdgeProperty > > &  g 
)

Function to get the stored edge property map associated with the specified const graph, i.e., the property map returns the data stored corresponding to each edge as the property.

Template Parameters
VertexPropertyThe vertex property type.
EdgePropertyThe edge property type.