Function (pr_bgl::partition_simple) for calculate the edge-weight partition function over all simple paths between every pair of vertices on a graph.
More...
Go to the source code of this file.
|
template<class Graph , class WeightMap , class DistanceMap , class ScoreMap , class IsUsedMap > |
double | pr_bgl::partition_simple (const Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor v_start, typename boost::graph_traits< Graph >::vertex_descriptor v_goal, double beta, double len_max, WeightMap weight_map, DistanceMap goal_distance_map, ScoreMap score_map, IsUsedMap is_used_map) |
|
Function (pr_bgl::partition_simple) for calculate the edge-weight partition function over all simple paths between every pair of vertices on a graph.
- Author
- Chris Dellin cdell.nosp@m.in@g.nosp@m.mail..nosp@m.com
- Copyright
- 2015 Carnegie Mellon University
-
License: BSD