#include <boost/next_prior.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/lookup_edge.hpp>
#include <boost/concept/assert.hpp>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::detail | |
Functions | |
template<class Graph > | |
graph_traits< Graph > ::degree_size_type | boost::detail::possible_edges (const Graph &g, std::size_t k, directed_tag) |
template<class Graph > | |
graph_traits< Graph > ::degree_size_type | boost::detail::possible_edges (const Graph &g, size_t k, undirected_tag) |
template<class Graph > | |
graph_traits< Graph > ::degree_size_type | boost::detail::count_edges (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, directed_tag) |
template<class Graph > | |
graph_traits< Graph > ::degree_size_type | boost::detail::count_edges (const Graph &g, typename graph_traits< Graph >::vertex_descriptor u, typename graph_traits< Graph >::vertex_descriptor v, undirected_tag) |
template<typename Graph , typename Vertex > | |
graph_traits< Graph > ::degree_size_type | boost::num_paths_through_vertex (const Graph &g, Vertex v) |
template<typename Graph , typename Vertex > | |
graph_traits< Graph > ::degree_size_type | boost::num_triangles_on_vertex (const Graph &g, Vertex v) |
template<typename T , typename Graph , typename Vertex > | |
T | boost::clustering_coefficient (const Graph &g, Vertex v) |
template<typename Graph , typename Vertex > | |
double | boost::clustering_coefficient (const Graph &g, Vertex v) |
template<typename Graph , typename ClusteringMap > | |
property_traits< ClusteringMap > ::value_type | boost::all_clustering_coefficients (const Graph &g, ClusteringMap cm) |
template<typename Graph , typename ClusteringMap > | |
property_traits< ClusteringMap > ::value_type | boost::mean_clustering_coefficient (const Graph &g, ClusteringMap cm) |