| /third_party/boost/libs/graph/test/ |
| D | adj_list_cc.cpp | 21 Graph; in main() typedef
22 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
23 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
24 BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >)); in main()
25 BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< Graph >)); in main()
26 BOOST_CONCEPT_ASSERT((IncidenceGraphConcept< Graph >)); in main()
27 BOOST_CONCEPT_ASSERT((AdjacencyGraphConcept< Graph >)); in main()
28 BOOST_CONCEPT_ASSERT((MutableIncidenceGraphConcept< Graph >)); in main()
29 BOOST_CONCEPT_ASSERT((MutableEdgeListGraphConcept< Graph >)); in main()
30 BOOST_CONCEPT_ASSERT((VertexMutablePropertyGraphConcept< Graph >)); in main()
[all …]
|
| D | test_graphs.cpp | 30 typedef undirected_graph< VertexBundle, EdgeBundle, GraphBundle > Graph; in main() typedef
31 BOOST_META_ASSERT(is_undirected_graph< Graph >); in main()
32 BOOST_META_ASSERT(is_multigraph< Graph >); in main()
33 BOOST_META_ASSERT(is_incidence_graph< Graph >); in main()
34 BOOST_META_ASSERT(is_bidirectional_graph< Graph >); in main()
35 BOOST_META_ASSERT(has_vertex_property< Graph >); in main()
36 BOOST_META_ASSERT(has_bundled_vertex_property< Graph >); in main()
37 BOOST_META_ASSERT(has_edge_property< Graph >); in main()
38 BOOST_META_ASSERT(has_bundled_edge_property< Graph >); in main()
39 BOOST_META_ASSERT(is_mutable_graph< Graph >); in main()
[all …]
|
| D | adj_matrix_cc.cpp | 19 typedef adjacency_matrix< directedS > Graph; in main() typedef
20 BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >)); in main()
21 BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< Graph >)); in main()
22 BOOST_CONCEPT_ASSERT((IncidenceGraphConcept< Graph >)); in main()
23 BOOST_CONCEPT_ASSERT((AdjacencyGraphConcept< Graph >)); in main()
24 BOOST_CONCEPT_ASSERT((MutableGraphConcept< Graph >)); in main()
25 BOOST_CONCEPT_ASSERT((AdjacencyMatrixConcept< Graph >)); in main()
28 typedef adjacency_matrix< undirectedS > Graph; in main() typedef
29 BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >)); in main()
30 BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< Graph >)); in main()
[all …]
|
| D | stanford_graph_cc.cpp | 27 typedef Graph* Graph; in main() typedef
28 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
29 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
30 BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >)); in main()
31 BOOST_CONCEPT_ASSERT((IncidenceGraphConcept< Graph >)); in main()
32 BOOST_CONCEPT_ASSERT((AdjacencyGraphConcept< Graph >)); in main()
34 (PropertyGraphConcept< Graph, Edge, edge_length_t >)); in main()
36 (PropertyGraphConcept< Graph, Vertex, u_property< Vertex > >)); in main()
38 (PropertyGraphConcept< Graph, Edge, a_property< Vertex > >)); in main()
41 typedef const Graph* Graph; in main() typedef
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | vertex_list_adaptor.hpp | 64 template<typename Graph, typename Distribution>
68 typename property_map<Graph, vertex_owner_t>::const_type,
69 typename property_map<Graph, vertex_local_t>::const_type>
70 make_distribution_global_index_map(const Graph& g, const Distribution& d) in make_distribution_global_index_map()
74 typename property_map<Graph, vertex_owner_t>::const_type, in make_distribution_global_index_map()
75 typename property_map<Graph, vertex_local_t>::const_type> in make_distribution_global_index_map()
123 template<typename Graph, typename GlobalIndexMap>
124 class vertex_list_adaptor : public graph_traits<Graph>
126 typedef graph_traits<Graph> inherited;
140 vertex_list_adaptor(const Graph& g, in vertex_list_adaptor()
[all …]
|
| D | distributed_graph_utility.hpp | 22 template <class Property, class Graph>
23 void property_on_inedges(Property p, const Graph& g) in property_on_inedges()
25 BGL_FORALL_VERTICES_T(u, g, Graph) in property_on_inedges()
26 BGL_FORALL_INEDGES_T(u, e, g, Graph) in property_on_inedges()
32 template <class Property, class Graph>
33 void property_on_outedges(Property p, const Graph& g) in property_on_outedges()
35 BGL_FORALL_VERTICES_T(u, g, Graph) in property_on_outedges()
36 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in property_on_outedges()
41 template <class Property, class Graph>
42 void property_on_successors(Property p, const Graph& g) in property_on_successors()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | degree_centrality.hpp | 16 template < typename Graph > struct degree_centrality_measure
18 typedef typename graph_traits< Graph >::degree_size_type degree_type;
19 typedef typename graph_traits< Graph >::vertex_descriptor vertex_type;
22 template < typename Graph >
23 struct influence_measure : public degree_centrality_measure< Graph >
25 typedef degree_centrality_measure< Graph > base_type;
29 inline degree_type operator()(vertex_type v, const Graph& g) in operator ()()
31 BOOST_CONCEPT_ASSERT((IncidenceGraphConcept< Graph >)); in operator ()()
36 template < typename Graph >
37 inline influence_measure< Graph > measure_influence(const Graph&) in measure_influence() argument
[all …]
|
| D | clustering_coefficient.hpp | 20 template < class Graph >
21 inline typename graph_traits< Graph >::degree_size_type possible_edges( in possible_edges()
22 const Graph& g, std::size_t k, directed_tag) in possible_edges()
24 BOOST_CONCEPT_ASSERT((GraphConcept< Graph >)); in possible_edges()
25 typedef typename graph_traits< Graph >::degree_size_type T; in possible_edges()
29 template < class Graph >
30 inline typename graph_traits< Graph >::degree_size_type possible_edges( in possible_edges()
31 const Graph& g, size_t k, undirected_tag) in possible_edges()
38 template < class Graph >
39 inline typename graph_traits< Graph >::degree_size_type count_edges( in count_edges()
[all …]
|
| D | graph_mutability_traits.hpp | 85 template < typename Graph > struct graph_mutability_traits
87 typedef typename Graph::mutability_category category;
90 template < typename Graph >
93 is_convertible< typename graph_mutability_traits< Graph >::category,
98 template < typename Graph >
101 is_convertible< typename graph_mutability_traits< Graph >::category,
106 template < typename Graph >
109 is_convertible< typename graph_mutability_traits< Graph >::category,
114 template < typename Graph >
117 is_convertible< typename graph_mutability_traits< Graph >::category,
[all …]
|
| D | r_c_shortest_paths.hpp | 26 template < class Graph, class Resource_Container >
29 r_c_shortest_paths_label< Graph, Resource_Container > >
34 r_c_shortest_paths_label< Graph, Resource_Container > >
37 r_c_shortest_paths_label< Graph, Resource_Container > >(),
38 const typename graph_traits< Graph >::edge_descriptor& ed
39 = graph_traits< Graph >::edge_descriptor(),
40 const typename graph_traits< Graph >::vertex_descriptor& vd
41 = graph_traits< Graph >::vertex_descriptor())
63 r_c_shortest_paths_label< Graph, Resource_Container > >
65 const typename graph_traits< Graph >::edge_descriptor pred_edge;
[all …]
|
| D | tiernan_all_cycles.hpp | 23 BOOST_concept(CycleVisitor, (Visitor)(Path)(Graph))
29 Graph g;
84 template < typename Path, typename Graph >
85 inline void cycle(const Path& p, const Graph& g) in cycle()
101 template < typename Path, typename Graph >
102 inline void cycle(const Path& p, const Graph& g) in cycle()
122 template < typename Graph, typename Path >
123 inline bool is_vertex_in_path(const Graph&, in is_vertex_in_path() argument
124 typename graph_traits< Graph >::vertex_descriptor v, const Path& p) in is_vertex_in_path()
129 template < typename Graph, typename ClosedMatrix >
[all …]
|
| D | graph_traits.hpp | 106 template < typename Graph > bool is_directed(const Graph&) in is_directed() argument
108 typedef typename graph_traits< Graph >::directed_category Cat; in is_directed()
113 template < typename Graph > bool is_undirected(const Graph& g) in is_undirected()
129 template < typename Graph >
132 typename graph_traits< Graph >::directed_category >
136 template < typename Graph >
137 struct is_undirected_graph : mpl::not_< is_directed_graph< Graph > >
156 template < typename Graph > bool allows_parallel_edges(const Graph&) in allows_parallel_edges() argument
158 typedef typename graph_traits< Graph >::edge_parallel_category Cat; in allows_parallel_edges()
170 template < typename Graph >
[all …]
|
| D | geodesic_distance.hpp | 16 template < typename Graph, typename DistanceType, typename ResultType,
19 : public geodesic_measure< Graph, DistanceType, ResultType >
21 typedef geodesic_measure< Graph, DistanceType, ResultType > base_type;
25 result_type operator()(distance_type d, const Graph& g) in operator ()()
27 BOOST_CONCEPT_ASSERT((VertexListGraphConcept< Graph >)); in operator ()()
40 template < typename Graph, typename DistanceMap >
41 inline mean_geodesic_measure< Graph,
43 measure_mean_geodesic(const Graph&, DistanceMap) in measure_mean_geodesic() argument
45 return mean_geodesic_measure< Graph, in measure_mean_geodesic()
49 template < typename T, typename Graph, typename DistanceMap >
[all …]
|
| D | closeness_centrality.hpp | 16 template < typename Graph, typename DistanceType, typename ResultType,
19 : public geodesic_measure< Graph, DistanceType, ResultType >
21 typedef geodesic_measure< Graph, DistanceType, ResultType > base_type;
25 result_type operator()(distance_type d, const Graph&) in operator ()()
37 template < typename Graph, typename DistanceMap >
38 inline closeness_measure< Graph,
41 measure_closeness(const Graph&, DistanceMap) in measure_closeness() argument
44 return closeness_measure< Graph, Distance, double, in measure_closeness()
48 template < typename T, typename Graph, typename DistanceMap >
49 inline closeness_measure< Graph,
[all …]
|
| D | wavefront.hpp | 27 template < typename Graph, typename VertexIndexMap >
28 typename graph_traits< Graph >::vertices_size_type ith_wavefront( in ith_wavefront()
29 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g, in ith_wavefront()
32 typename graph_traits< Graph >::vertex_descriptor v, w; in ith_wavefront()
33 typename graph_traits< Graph >::vertices_size_type b = 1; in ith_wavefront()
34 typename graph_traits< Graph >::out_edge_iterator edge_it2, edge_it2_end; in ith_wavefront()
35 typename graph_traits< Graph >::vertices_size_type index_i = index[i]; in ith_wavefront()
40 typename graph_traits< Graph >::vertex_iterator ui, ui_end; in ith_wavefront()
62 template < typename Graph >
63 typename graph_traits< Graph >::vertices_size_type ith_wavefront( in ith_wavefront()
[all …]
|
| D | graph_stats.hpp | 22 template < typename Graph > struct sort_edge_by_origin
25 typedef typename graph_traits< Graph >::edge_descriptor edge_type;
27 explicit sort_edge_by_origin(Graph& g) : g(g) {} in sort_edge_by_origin()
36 Graph& g;
39 template < typename Graph > struct equal_edge
42 typedef typename graph_traits< Graph >::edge_descriptor edge_type;
44 explicit equal_edge(Graph& g) : g(g) {} in equal_edge()
52 Graph& g;
55 template < typename Graph > unsigned long num_dup_edges(Graph& g) in num_dup_edges()
57 typedef typename graph_traits< Graph >::edge_iterator e_iterator_type; in num_dup_edges()
[all …]
|
| D | bron_kerbosch_all_cliques.hpp | 24 BOOST_concept(CliqueVisitor, (Visitor)(Clique)(Graph))
30 Graph g;
92 template < typename VertexSet, typename Graph >
93 void clique(const VertexSet&, Graph&) in clique()
106 template < typename Clique, typename Graph >
107 inline void clique(const Clique& p, const Graph& g) in clique()
122 template < typename Graph >
123 inline bool is_connected_to_clique(const Graph& g, in is_connected_to_clique()
124 typename graph_traits< Graph >::vertex_descriptor u, in is_connected_to_clique()
125 typename graph_traits< Graph >::vertex_descriptor v, in is_connected_to_clique()
[all …]
|
| D | edmonds_karp_max_flow.hpp | 34 template < class Graph, class ResCapMap >
35 filtered_graph< Graph, is_residual_edge< ResCapMap > > residual_graph( in residual_graph()
36 Graph& g, ResCapMap residual_capacity) in residual_graph()
38 return filtered_graph< Graph, is_residual_edge< ResCapMap > >( in residual_graph()
42 template < class Graph, class PredEdgeMap, class ResCapMap,
44 inline void augment(Graph& g, in augment()
45 typename graph_traits< Graph >::vertex_descriptor src, in augment()
46 typename graph_traits< Graph >::vertex_descriptor sink, PredEdgeMap p, in augment()
49 typename graph_traits< Graph >::edge_descriptor e; in augment()
50 typename graph_traits< Graph >::vertex_descriptor u; in augment()
[all …]
|
| D | properties.hpp | 168 template < class Graph, class Property, class Tag > struct bind_
176 template < class Graph, class Property, class Tag > struct bind_
205 template < typename Graph, typename Enable = void > struct graph_tag_or_void
210 template < typename Graph >
211 struct graph_tag_or_void< Graph,
212 typename return_void< typename Graph::graph_tag >::type >
214 typedef typename Graph::graph_tag type;
217 template < class Graph, class PropertyTag >
219 : edge_property_selector< typename graph_tag_or_void< Graph >::type >::
220 type::template bind_< Graph,
[all …]
|
| D | graph_utility.hpp | 44 template < class Graph >
45 inline std::pair< typename graph_traits< Graph >::out_edge_iterator,
46 typename graph_traits< Graph >::out_edge_iterator >
47 incident_edges(typename graph_traits< Graph >::vertex_descriptor u, Graph& g) in incident_edges()
52 template < class Graph >
53 inline typename graph_traits< Graph >::vertex_descriptor opposite( in opposite()
54 typename graph_traits< Graph >::edge_descriptor e, in opposite()
55 typename graph_traits< Graph >::vertex_descriptor v, const Graph& g) in opposite()
57 typedef typename graph_traits< Graph >::vertex_descriptor vertex_descriptor; in opposite()
69 template < typename Vertex, typename Graph > struct incident_from_predicate
[all …]
|
| D | successive_shortest_path_nonnegative_weights.hpp | 34 template < class Graph, class Weight, class Distance, class Reversed >
37 MapReducedWeight< Graph, Weight, Distance, Reversed > >
39 typedef graph_traits< Graph > gtraits;
46 MapReducedWeight(const Graph& g, Weight w, Distance d, Reversed r) in MapReducedWeight()
58 const Graph& g_;
64 template < class Graph, class Weight, class Distance, class Reversed >
65 MapReducedWeight< Graph, Weight, Distance, Reversed > make_mapReducedWeight( in make_mapReducedWeight()
66 const Graph& g, Weight w, Distance d, Reversed r) in make_mapReducedWeight()
68 return MapReducedWeight< Graph, Weight, Distance, Reversed >( in make_mapReducedWeight()
74 template < class Graph, class Capacity, class ResidualCapacity, class Reversed,
[all …]
|
| D | property_iter_range.hpp | 32 template < class Graph, class PropertyTag > class graph_property_iter_range
34 typedef typename property_map< Graph, PropertyTag >::type map_type;
36 typename property_map< Graph, PropertyTag >::const_type const_map_type;
39 typename graph_traits< Graph >::vertex_iterator,
40 typename graph_traits< Graph >::edge_iterator >::type iter;
55 template < class Graph, class Tag >
56 typename graph_property_iter_range< Graph, Tag >::type
58 Graph& graph, const Tag& tag, const vertex_property_tag&) in get_property_iter_range_kind()
60 typedef typename graph_property_iter_range< Graph, Tag >::iterator iter; in get_property_iter_range_kind()
65 template < class Graph, class Tag >
[all …]
|
| D | edge_coloring.hpp | 31 template < typename Graph, typename ColorMap >
32 bool is_free(const Graph& g, ColorMap color, in is_free()
33 typename boost::graph_traits< Graph >::vertex_descriptor u, in is_free()
39 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in is_free()
49 template < typename Graph, typename ColorMap >
50 std::vector< typename boost::graph_traits< Graph >::vertex_descriptor >
51 maximal_fan(const Graph& g, ColorMap color, in maximal_fan()
52 typename boost::graph_traits< Graph >::vertex_descriptor x, in maximal_fan()
53 typename boost::graph_traits< Graph >::vertex_descriptor y) in maximal_fan()
56 typename boost::graph_traits< Graph >::vertex_descriptor vertex_t; in maximal_fan()
[all …]
|
| /third_party/boost/boost/graph/detail/ |
| D | labeled_graph_traits.hpp | 85 template < typename Graph >
88 is_convertible< typename graph_mutability_traits< Graph >::category,
93 template < typename Graph >
96 is_convertible< typename graph_mutability_traits< Graph >::category,
101 template < typename Graph >
104 is_convertible< typename graph_mutability_traits< Graph >::category,
109 template < typename Graph >
112 is_convertible< typename graph_mutability_traits< Graph >::category,
117 template < typename Graph >
120 is_convertible< typename graph_mutability_traits< Graph >::category,
[all …]
|
| /third_party/boost/boost/msm/mpl_graph/ |
| D | mpl_graph.hpp | 46 template<typename Edge, typename Graph>
48 …ame mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Graph::d…
50 template<typename Edge, typename Graph>
52 …ame mpl::at<typename detail::produce_edge_st_map<typename Graph::representation, typename Graph::d…
54 template<typename Vertex, typename Graph>
56 …mpl::fold<typename detail::produce_out_map<typename Graph::representation, Vertex, typename Graph:…
60 template<typename Vertex, typename Graph>
62 mpl::size<typename out_edges<Vertex, Graph>::type>
66 template<typename Vertex, typename Graph>
68 …mpl::fold<typename detail::produce_in_map<typename Graph::representation, Vertex, typename Graph::…
[all …]
|