| /dports/databases/pgrouting/pgrouting-3.2.0/include/dijkstra/ |
| H A D | pgr_dijkstra.hpp | 112 int64_t start_vertex, in drivingDistance() argument
116 start_vertex, in drivingDistance()
119 start_vertex, in drivingDistance()
134 Path p(start_vertex, start_vertex); in drivingDistance()
149 start_vertex, in drivingDistance()
156 start_vertex, in drivingDistance()
174 int64_t start_vertex, in dijkstra() argument
214 int64_t start_vertex, in dijkstra() argument
490 V start_vertex, in execute_drivingDistance_no_init() argument
499 start_vertex, in execute_drivingDistance_no_init()
[all …]
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/io/ |
| H A D | ReadTemplate.cpp | 82 EntityHandle start_vertex; in load_file() local
83 result = read_vertices(num_verts, start_vertex, read_ents); in load_file()
94 result = read_elements(num_elems, start_vertex, start_elem, read_ents); in load_file()
102 result = create_sets(num_sets, start_vertex, num_verts, start_elem, num_elems, read_ents); in load_file()
122 ErrorCode ReadTemplate::read_vertices(int num_verts, EntityHandle &start_vertex, Range &read_ents) in read_vertices() argument
128 ErrorCode result = readMeshIface->get_node_coords(3, num_verts, 1, start_vertex, in read_vertices()
141 read_ents.insert(start_vertex, start_vertex + num_verts - 1); in read_vertices()
147 ErrorCode ReadTemplate::read_elements(int num_elems, EntityHandle start_vertex, in read_elements() argument
176 conn_array[i] = ind_array[i] + start_vertex + OFFSET; in read_elements()
179 assert(conn_array[i] >= start_vertex && conn_array[i] <= *read_ents.rbegin()); in read_elements()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 30 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
65 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
68 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
130 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
153 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
157 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
183 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
214 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
226 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| H A D | undirected_dfs.hpp | 141 Vertex start_vertex) in undirected_dfs() argument
157 if (start_vertex != *vertices(g).first){ vis.start_vertex(start_vertex, g); in undirected_dfs()
158 detail::undir_dfv_impl(g, start_vertex, vis, vertex_color, edge_color); in undirected_dfs()
163 if (u_color == Color::white()) { vis.start_vertex(*ui, g); in undirected_dfs()
186 apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
191 undirected_dfs(g, vis, vertex_color, edge_color, start_vertex); in apply()
201 apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
214 start_vertex); in apply()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 29 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init()
60 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
63 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
134 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
155 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
158 dijkstra_shortest_paths_no_color_map_no_init(graph, start_vertex, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2()
182 dijkstra_shortest_paths_no_color_map(graph, start_vertex, in dijkstra_no_color_map_dispatch2()
210 detail::dijkstra_no_color_map_dispatch2(graph, start_vertex, in dijkstra_no_color_map_dispatch1()
221 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 29 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init()
60 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
63 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
134 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
155 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
158 dijkstra_shortest_paths_no_color_map_no_init(graph, start_vertex, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2()
182 dijkstra_shortest_paths_no_color_map(graph, start_vertex, in dijkstra_no_color_map_dispatch2()
210 detail::dijkstra_no_color_map_dispatch2(graph, start_vertex, in dijkstra_no_color_map_dispatch1()
221 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 29 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init()
60 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
63 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
134 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
155 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
158 dijkstra_shortest_paths_no_color_map_no_init(graph, start_vertex, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2()
182 dijkstra_shortest_paths_no_color_map(graph, start_vertex, in dijkstra_no_color_map_dispatch2()
210 detail::dijkstra_no_color_map_dispatch2(graph, start_vertex, in dijkstra_no_color_map_dispatch1()
221 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 29 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init()
60 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
63 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
134 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
155 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
158 dijkstra_shortest_paths_no_color_map_no_init(graph, start_vertex, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2()
182 dijkstra_shortest_paths_no_color_map(graph, start_vertex, in dijkstra_no_color_map_dispatch2()
210 detail::dijkstra_no_color_map_dispatch2(graph, start_vertex, in dijkstra_no_color_map_dispatch1()
221 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 30 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
65 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
68 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
130 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
153 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
157 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
183 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
214 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
226 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 30 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
65 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
68 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
130 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
153 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
157 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
183 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
214 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
226 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
75 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
78 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
140 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
163 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
167 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
181 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
190 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
222 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
234 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| H A D | undirected_dfs.hpp | 135 Vertex start_vertex) in undirected_dfs() argument
151 if (start_vertex != *vertices(g).first){ vis.start_vertex(start_vertex, g); in undirected_dfs()
152 detail::undir_dfv_impl(g, start_vertex, vis, vertex_color, edge_color); in undirected_dfs()
157 if (u_color == Color::white()) { vis.start_vertex(*ui, g); in undirected_dfs()
180 apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
185 undirected_dfs(g, vis, vertex_color, edge_color, start_vertex); in apply()
195 apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
208 start_vertex); in apply()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | dijkstra_shortest_paths_no_color_map.hpp | 31 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init() argument
74 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
77 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
139 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
162 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
166 start_vertex, predecessor_map, distance_map, weight_map, in dijkstra_shortest_paths_no_color_map()
180 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2() argument
192 (graph, start_vertex, in dijkstra_no_color_map_dispatch2()
223 (graph, start_vertex, choose_param(distance_map, in dijkstra_no_color_map_dispatch1()
235 typename graph_traits<Graph>::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map() argument
[all …]
|
| /dports/databases/pgrouting/pgrouting-3.2.0/include/bellman_ford/ |
| H A D | pgr_bellman_ford.hpp | 64 int64_t start_vertex, in bellman_ford() argument
75 if (!graph.has_vertex(start_vertex) in bellman_ford()
77 return Path(start_vertex, end_vertex); in bellman_ford()
81 auto v_source(graph.get_V(start_vertex)); in bellman_ford()
99 int64_t start_vertex, in bellman_ford() argument
109 if (!graph.has_vertex(start_vertex)) in bellman_ford()
111 auto v_source(graph.get_V(start_vertex)); in bellman_ford()
139 const std::vector < int64_t > &start_vertex, in bellman_ford()
144 for (const auto &start : start_vertex) { in bellman_ford()
160 const std::vector< int64_t > &start_vertex, in bellman_ford()
[all …]
|
| /dports/databases/pgrouting/pgrouting-3.2.0/include/dagShortestPath/ |
| H A D | pgr_dagShortestPath.hpp | 58 int64_t start_vertex, in dag() argument
70 if (!graph.has_vertex(start_vertex) in dag()
72 return Path(start_vertex, end_vertex); in dag()
76 auto v_source(graph.get_V(start_vertex)); in dag()
94 int64_t start_vertex, in dag() argument
107 if (!graph.has_vertex(start_vertex)) in dag()
109 auto v_source(graph.get_V(start_vertex)); in dag()
137 const std::vector < int64_t > &start_vertex, in dag()
142 for (const auto &start : start_vertex) { in dag()
158 const std::vector< int64_t > &start_vertex, in dag()
[all …]
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | depth_first_search.hpp | 37 vis.start_vertex(u, g); in constraints()
200 … if (start_vertex != implicit_cast<Vertex>(*vertices(g).first)){ vis.start_vertex(start_vertex, g); in depth_first_search()
201 detail::depth_first_visit_impl(g, start_vertex, vis, color, in depth_first_search()
207 if (u_color == Color::white()) { vis.start_vertex(*ui, g); in depth_first_search()
227 apply(const VertexListGraph& g, DFSVisitor vis, Vertex start_vertex, in apply()
231 depth_first_search(g, vis, color, start_vertex); in apply()
240 apply(const VertexListGraph& g, DFSVisitor vis, Vertex start_vertex, in apply()
251 start_vertex); in apply()
268 void start_vertex(Vertex u, const Graph& g) { in start_vertex() function in boost::dfs_visitor
341 vis.start_vertex(u, g); in depth_first_visit()
[all …]
|
| H A D | undirected_dfs.hpp | 135 Vertex start_vertex) in undirected_dfs() argument
151 if (start_vertex != *vertices(g).first){ vis.start_vertex(start_vertex, g); in undirected_dfs()
152 detail::undir_dfv_impl(g, start_vertex, vis, vertex_color, edge_color); in undirected_dfs()
157 if (u_color == Color::white()) { vis.start_vertex(*ui, g); in undirected_dfs()
180 apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
185 undirected_dfs(g, vis, vertex_color, edge_color, start_vertex); in apply()
195 apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
208 start_vertex); in apply()
|