| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | copy.hpp | 346 struct graph_copy_visitor : public bfs_visitor<> struct
348 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
353 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
362 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
373 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
383 NewGraph& g_out;
384 Copy2OrigIndexMap orig2copy;
385 CopyVertex copy_vertex;
386 CopyEdge copy_edge;
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | copy.hpp | 346 struct graph_copy_visitor : public bfs_visitor<> struct
348 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() argument
353 void examine_vertex(Vertex u, const Graph& g_in) const { in examine_vertex()
361 void examine_edge(Edge e, const Graph& g_in) const { in examine_edge()
370 NewGraph& g_out;
371 Copy2OrigIndexMap orig2copy;
372 CopyVertex copy_vertex;
373 CopyEdge copy_edge;
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | copy.hpp | 440 struct graph_copy_visitor : public bfs_visitor<> struct
442 graph_copy_visitor( in graph_copy_visitor() argument
449 typename graph_traits< NewGraph >::vertex_descriptor copy_one_vertex( in copy_one_vertex()
460 void tree_edge(Edge e, const Graph& g_in) const in tree_edge()
472 void non_tree_edge(Edge e, const Graph& g_in) const in non_tree_edge()
484 NewGraph& g_out;
485 Copy2OrigIndexMap orig2copy;
486 CopyVertex copy_vertex;
487 CopyEdge copy_edge;
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | copy.hpp | 440 struct graph_copy_visitor : public bfs_visitor<> struct
442 graph_copy_visitor( in graph_copy_visitor() function
449 typename graph_traits< NewGraph >::vertex_descriptor copy_one_vertex( in copy_one_vertex()
460 void tree_edge(Edge e, const Graph& g_in) const in tree_edge()
472 void non_tree_edge(Edge e, const Graph& g_in) const in non_tree_edge()
484 NewGraph& g_out;
485 Copy2OrigIndexMap orig2copy;
486 CopyVertex copy_vertex;
487 CopyEdge copy_edge;
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | copy.hpp | 440 struct graph_copy_visitor : public bfs_visitor<> struct
442 graph_copy_visitor( in graph_copy_visitor() argument
449 typename graph_traits< NewGraph >::vertex_descriptor copy_one_vertex( in copy_one_vertex()
460 void tree_edge(Edge e, const Graph& g_in) const in tree_edge()
472 void non_tree_edge(Edge e, const Graph& g_in) const in non_tree_edge()
484 NewGraph& g_out;
485 Copy2OrigIndexMap orig2copy;
486 CopyVertex copy_vertex;
487 CopyEdge copy_edge;
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() argument
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() argument
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() argument
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() argument
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | copy.hpp | 440 struct graph_copy_visitor : public bfs_visitor<> struct
442 graph_copy_visitor( in graph_copy_visitor() argument
449 typename graph_traits< NewGraph >::vertex_descriptor copy_one_vertex( in copy_one_vertex()
460 void tree_edge(Edge e, const Graph& g_in) const in tree_edge()
472 void non_tree_edge(Edge e, const Graph& g_in) const in non_tree_edge()
484 NewGraph& g_out;
485 Copy2OrigIndexMap orig2copy;
486 CopyVertex copy_vertex;
487 CopyEdge copy_edge;
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | copy.hpp | 392 struct graph_copy_visitor : public bfs_visitor<> struct
394 graph_copy_visitor(NewGraph& graph, Copy2OrigIndexMap c, in graph_copy_visitor() function
399 typename graph_traits<NewGraph>::vertex_descriptor copy_one_vertex(Vertex u) const { in copy_one_vertex()
408 void tree_edge(Edge e, const Graph& g_in) const { in tree_edge()
419 void non_tree_edge(Edge e, const Graph& g_in) const { in non_tree_edge()
429 NewGraph& g_out;
430 Copy2OrigIndexMap orig2copy;
431 CopyVertex copy_vertex;
432 CopyEdge copy_edge;
|