LEMUR Packages: ompl_lemur or_lemur pr_bgl prpy_lemur
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Groups Pages
Classes | Functions
partition_all.h File Reference

Functions for calculate the edge-weight partition function over all paths between every pair of vertices on a graph. More...

Go to the source code of this file.

Classes

struct  pr_bgl::partition_all_divergent_exception
 
class  pr_bgl::partition_all_matrix
 

Functions

template<class Graph , class CouplingMap , class TempMap >
void pr_bgl::partition_all_update_directed_edge (const Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor v_a, typename boost::graph_traits< Graph >::vertex_descriptor v_b, double weight_frac, bool is_add, CouplingMap coupling_map, TempMap cs_xa, TempMap cs_by)
 
template<class Graph , class CouplingMap , class TempMap >
void pr_bgl::partition_all_update_edge (const Graph &g, typename boost::graph_traits< Graph >::edge_descriptor edge, double weight_frac, bool is_add, CouplingMap coupling_map, TempMap cs_xa, TempMap cs_by)
 
template<class Graph , class CouplingMap >
void pr_bgl::partition_all_init (const Graph &g, CouplingMap coupling_map)
 
template<class Graph , class WeightMap , class CouplingMap , class TempMap >
void pr_bgl::partition_all (const Graph &g, double len_ref, WeightMap weight_map, CouplingMap coupling_map, TempMap cs_xa, TempMap cs_by)
 
template<class Graph , class CouplingMap >
double pr_bgl::partition_all_without_edge (const Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor v_x, typename boost::graph_traits< Graph >::vertex_descriptor v_y, typename boost::graph_traits< Graph >::edge_descriptor edge, double weight_frac, CouplingMap coupling_map)
 

Detailed Description

Functions for calculate the edge-weight partition function over all paths between every pair of vertices on a graph.

Author
Chris Dellin cdell.nosp@m.in@g.nosp@m.mail..nosp@m.com