| /third_party/boost/libs/graph/test/ |
| D | graphviz_test.cpp | 45 template < typename graph_t, typename NameMap, typename MassMap,
47 bool test_graph(std::istream& dotfile, graph_t& graph,
52 template < typename graph_t >
58 graph_t g; in test_graph()
64 template < typename graph_t, typename NameMap, typename MassMap,
66 bool test_graph(std::istream& dotfile, graph_t& graph,
78 boost::ref_property_map< graph_t*, std::string > gname(
101 typename graph_traits< graph_t >::vertex_iterator i, j;
119 typename graph_traits< graph_t >::edge_iterator i, j;
175 graph_t; typedef
[all …]
|
| D | dfs_cc.cpp | 26 graph_t; in main() typedef
27 graph_t& g = static_object< graph_t >::get(); in main()
38 graph_t; in main() typedef
39 graph_t& g = static_object< graph_t >::get(); in main()
51 graph_t; in main() typedef
52 graph_t& g = static_object< graph_t >::get(); in main()
|
| D | dijkstra_cc.cpp | 48 graph_t; in main() typedef
49 graph_t& g = static_object< graph_t >::get(); in main()
51 typedef graph_traits< graph_t >::edge_descriptor edge_t; in main()
72 graph_t; in main() typedef
73 graph_t& g = static_object< graph_t >::get(); in main()
89 graph_t; in main() typedef
90 graph_t& g = static_object< graph_t >::get(); in main()
105 graph_t; in main() typedef
106 graph_t& g = static_object< graph_t >::get(); in main()
108 typedef graph_traits< graph_t >::edge_descriptor edge_t; in main()
|
| D | lvalue_pmap.cpp | 32 graph_t; typedef
34 double& foo_1(graph_t& x) in foo_1()
36 property_map< graph_t, vertex_info_t >::type pmap = get(vertex_info_t(), x); in foo_1()
40 const double& foo_2(graph_t const& x) in foo_2()
42 property_map< graph_t, vertex_info_t >::const_type pmap in foo_2()
47 double& bar_1(graph_t& x) in bar_1()
49 property_map< graph_t, edge_info_t >::type pmap = get(edge_info_t(), x); in bar_1()
53 const double& bar_2(graph_t const& x) in bar_2()
55 property_map< graph_t, edge_info_t >::const_type pmap in bar_2()
|
| D | bfs_cc.cpp | 26 graph_t; in main() typedef
27 graph_t& g = static_object< graph_t >::get(); in main()
39 graph_t; in main() typedef
40 graph_t& g = static_object< graph_t >::get(); in main()
53 graph_t; in main() typedef
54 graph_t& g = static_object< graph_t >::get(); in main()
|
| D | graphml_test.cpp | 44 graph_t; in main() typedef
45 graph_t g; in main()
50 boost::ref_property_map< graph_t*, std::string > gname( in main()
76 graph_t g2; in main()
81 boost::ref_property_map< graph_t*, std::string > gname2( in main()
92 graph_traits< graph_t >::vertex_iterator v, v_end; in main()
97 graph_traits< graph_t >::edge_iterator e, e_end; in main()
|
| D | read_propmap.cpp | 22 typedef adjacency_list< vecS, vecS, directedS, no_property, EdgeProp > graph_t; typedef
25 typedef property_map< graph_t, double EdgeProp::* >::type WeightMap; in main()
26 typedef property_map< graph_t, double EdgeProp::* >::const_type cWeightMap; in main()
27 typedef graph_traits< graph_t >::edge_descriptor Edge; in main()
|
| /third_party/boost/boost/graph/ |
| D | boyer_myrvold_planar_test.hpp | 52 ArgumentPack, tag::graph >::type >::type graph_t; in dispatched_boyer_myrvold() typedef
54 typedef typename property_map< graph_t, vertex_index_t >::const_type in dispatched_boyer_myrvold()
61 graph_t const& g = args[graph]; in dispatched_boyer_myrvold()
64 boyer_myrvold_impl< graph_t, vertex_index_map_t, in dispatched_boyer_myrvold()
77 ArgumentPack, tag::graph >::type >::type graph_t; in dispatched_boyer_myrvold() typedef
79 typedef typename property_map< graph_t, vertex_index_t >::const_type in dispatched_boyer_myrvold()
86 typedef typename property_map< graph_t, edge_index_t >::const_type in dispatched_boyer_myrvold()
93 graph_t const& g = args[graph]; in dispatched_boyer_myrvold()
98 boyer_myrvold_impl< graph_t, vertex_index_map_t, in dispatched_boyer_myrvold()
118 ArgumentPack, tag::graph >::type >::type graph_t; in dispatched_boyer_myrvold() typedef
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | dijkstra-example-listS.cpp | 28 graph_t; in main() typedef
44 graph_traits< graph_t >::vertex_iterator i, iend; in main()
46 graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); in main()
47 property_map< graph_t, edge_weight_t >::type weightmap in main()
51 property_map< graph_t, vertex_index_t >::type indexmap in main()
53 property_map< graph_t, vertex_name_t >::type name = get(vertex_name, g); in main()
63 property_map< graph_t, vertex_distance_t >::type d in main()
65 property_map< graph_t, vertex_predecessor_t >::type p in main()
70 graph_traits< graph_t >::vertex_iterator vi, vend; in main()
87 graph_traits< graph_t >::edge_iterator ei, ei_end; in main()
[all …]
|
| D | graph-thingie.cpp | 48 graph_t; in main() typedef
51 graph_t graph(0); in main()
54 property_map< graph_t, vertex_name_t >::type vname in main()
58 property_map< graph_t, vertex_label_t >::type vlabel in main()
62 property_map< graph_t, vertex_root_t >::type root = get(vertex_root, graph); in main()
65 property_map< graph_t, edge_name_t >::type elabel = get(edge_name, graph); in main()
69 ref_property_map< graph_t*, string > gname(get_property(graph, graph_name)); in main()
73 ref_property_map< graph_t*, string > gid( in main()
101 BOOST_FOREACH (graph_t::vertex_descriptor v, vertices(graph)) in main()
|
| D | bfs-example2.cpp | 44 typedef adjacency_list< listS, listS, undirectedS, VertexProps > graph_t; in main() typedef
67 graph_t g; in main()
68 std::vector< graph_traits< graph_t >::vertex_descriptor > verts; in main()
74 typedef graph_traits< graph_t >::vertices_size_type v_size_t; in main()
75 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
79 typedef graph_traits< graph_t >::vertices_size_type Size; in main()
82 typedef property_map< graph_t, std::size_t VertexProps::* >::type in main()
92 property_map< graph_t, unsigned int VertexProps::* >::type > in main()
94 graph_traits< graph_t >::vertex_iterator vi, vi_end; in main()
104 std::vector< graph_traits< graph_t >::vertices_size_type > discover_order( in main()
|
| D | dijkstra-no-color-map-example.cpp | 27 graph_t; in main() typedef
28 typedef graph_traits< graph_t >::vertex_descriptor vertex_descriptor; in main()
45 graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); in main()
46 property_map< graph_t, edge_weight_t >::type weightmap in main()
59 graph_traits< graph_t >::vertex_iterator vi, vend; in main()
77 graph_traits< graph_t >::edge_iterator ei, ei_end; in main()
80 graph_traits< graph_t >::edge_descriptor e = *ei; in main()
81 graph_traits< graph_t >::vertex_descriptor u = source(e, g), in main()
|
| D | dijkstra-example.cpp | 23 graph_t; in main() typedef
24 typedef graph_traits< graph_t >::vertex_descriptor vertex_descriptor; in main()
41 graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); in main()
42 property_map< graph_t, edge_weight_t >::type weightmap in main()
55 graph_traits< graph_t >::vertex_iterator vi, vend; in main()
73 graph_traits< graph_t >::edge_iterator ei, ei_end; in main()
76 graph_traits< graph_t >::edge_descriptor e = *ei; in main()
77 graph_traits< graph_t >::vertex_descriptor u = source(e, g), in main()
|
| D | read_graphviz.cpp | 32 graph_t; in main() typedef
35 graph_t graph(0); in main()
38 property_map< graph_t, vertex_name_t >::type name = get(vertex_name, graph); in main()
41 property_map< graph_t, vertex_color_t >::type mass in main()
45 property_map< graph_t, edge_weight_t >::type weight in main()
50 boost::ref_property_map< graph_t*, std::string > gname( in main()
|
| D | graph_as_tree.cpp | 37 graph_t; in main() typedef
38 typedef graph_traits< graph_t >::vertex_descriptor vertex_t; in main()
40 graph_t g; in main()
47 typedef property_map< graph_t, vertex_name_t >::type vertex_name_map_t; in main()
54 property_map< graph_t, vertex_index_t >::type > in main()
57 typedef graph_as_tree< graph_t, parent_map_t > tree_t; in main()
|
| D | transpose-example.cpp | 19 graph_t; in main() typedef
32 graph_t G(N); in main()
33 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, G); in main()
35 graph_traits< graph_t >::vertex_iterator v, v_end; in main()
48 graph_t G_T; in main()
53 graph_traits< graph_t >::edge_iterator ei, ei_end; in main()
|
| D | bfs-example.cpp | 36 typedef adjacency_list< vecS, vecS, undirectedS > graph_t; in main() typedef
59 graph_t g(N); in main()
63 typedef graph_traits< graph_t >::vertices_size_type v_size_t; in main()
64 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
68 typedef graph_traits< graph_t >::vertices_size_type Size; in main()
73 property_map< graph_t, vertex_index_t >::const_type > in main()
82 std::vector< graph_traits< graph_t >::vertices_size_type > discover_order( in main()
|
| D | filtered-copy-example.cpp | 34 graph_t; in main() typedef
47 graph_t G(N); in main()
48 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, G); in main()
50 graph_traits< graph_t >::vertex_iterator v, v_end; in main()
66 graph_t G_copy; in main()
68 make_filtered_graph(G, keep_all(), non_zero_degree< graph_t >(G)), in main()
|
| D | property-map-traits-eg.cpp | 17 graph_t; in main() typedef
18 graph_t g; in main()
19 graph_traits< graph_t >::vertex_descriptor u = add_vertex(g); in main()
20 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, g); in main()
|
| D | copy-example.cpp | 19 graph_t; in main() typedef
32 graph_t G(N); in main()
33 property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, G); in main()
35 graph_traits< graph_t >::vertex_iterator v, v_end; in main()
48 graph_t G_copy; in main()
|
| D | biconnected_components.cpp | 33 graph_t; in main() typedef
34 typedef graph_traits< graph_t >::vertex_descriptor vertex_t; in main()
35 graph_t g(9); in main()
48 property_map< graph_t, edge_component_t >::type component in main()
67 graph_traits< graph_t >::edge_iterator ei, ei_end; in main()
|
| D | leda-graph-eg.cpp | 14 typedef leda::GRAPH< std::string, int > graph_t; in main() typedef
15 graph_t g; in main()
21 typedef property_map< graph_t, vertex_all_t >::type NodeMap; in main()
23 graph_traits< graph_t >::vertex_iterator vi, vi_end; in main()
|
| D | bfs-name-printer.cpp | 78 typedef adjacency_list< listS, vecS, directedS, VP, EP > graph_t; in main() typedef
79 graph_t g; in main()
81 property_map< graph_t, char VP::* >::type name_map = get(&VP::name, g); in main()
82 property_map< graph_t, double EP::* >::type delay_map = get(&EP::weight, g); in main()
86 typedef property_map< graph_t, char VP::* >::type VertexNameMap; in main()
87 graph_traits< graph_t >::vertex_descriptor a = *vertices(g).first; in main()
|
| D | dag_shortest_paths.cpp | 30 graph_t; in main() typedef
31 graph_t g(6); in main()
53 property_map< graph_t, vertex_distance_t >::type d_map in main()
64 property_map< graph_t, edge_weight_t >::type w_map = get(edge_weight, g); in main()
71 graph_traits< graph_t >::vertex_iterator vi, vi_end; in main()
|
| /third_party/ltp/tools/sparse/sparse-src/gvpr/ |
| D | subg-fwd | 10 graph_t find_owner(obj_t o, graph_t g)
12 graph_t g1;
20 graph_t sg = subg ($, sprintf("incoming-%s", ARGV[0]));
21 graph_t returns = graph("return-edges", ""); // Temporary graph to hold return edges
22 graph_t target, g, g2;
|