Home
last modified time | relevance | path

Searched defs:undirected_tag (Results 1 – 6 of 6) sorted by relevance

/third_party/boost/boost/graph/
Dclustering_coefficient.hpp31 const Graph& g, size_t k, undirected_tag) in possible_edges() argument
53 typename graph_traits< Graph >::vertex_descriptor v, undirected_tag) in count_edges() argument
Dgraph_traits.hpp92 struct undirected_tag struct
102 inline bool is_directed(undirected_tag) { return false; } in is_directed() argument
Dgraph_utility.hpp177 void print_graph_dispatch(const IncidenceGraph& G, Name name, undirected_tag, in print_graph_dispatch() argument
276 bool is_adj_dispatch(Graph& g, Vertex a, Vertex b, undirected_tag) in is_adj_dispatch() argument
/third_party/boost/libs/graph/example/
Dgraph-assoc-types.cpp48 template < typename Graph > void foo_dispatch(Graph& g, boost::undirected_tag) in foo_dispatch()
/third_party/boost/boost/graph/distributed/
Dcrauser_et_al_shortest_paths.hpp494 Compare, undirected_tag, bidirectional_graph_tag) in initialize_min_in_weights() argument
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp2003 Graph& g, vertex_descriptor u, boost::undirected_tag) in remove_vertex_dispatch()