| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/ |
| H A D | connectivity.h | 264 template <typename Digraph>
266 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnected()
331 checkConcept<concepts::Digraph, Digraph>(); in countStronglyConnectedComponents()
408 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnectedComponents()
476 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnectedCutArcs()
573 const Digraph& _graph;
1294 checkConcept<concepts::Digraph, Digraph>(); in dag()
1343 checkConcept<concepts::Digraph, Digraph>(); in topologicalSort()
1353 DfsVisit<Digraph, TopologicalSortVisitor<Digraph, NodeMap> > in topologicalSort()
1385 checkConcept<concepts::Digraph, Digraph>(); in checkedTopologicalSort()
[all …]
|
| H A D | dfs.h | 43 typedef GR Digraph; typedef
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
141 typedef typename TR::Digraph Digraph; typedef
166 const Digraph *G;
765 typedef GR Digraph; typedef
906 typedef typename TR::Digraph Digraph; typedef
943 Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
967 Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1133 typedef GR Digraph; typedef
1171 typedef GR Digraph; typedef
[all …]
|
| H A D | bfs.h | 43 typedef GR Digraph; typedef
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
141 typedef typename TR::Digraph Digraph; typedef
166 const Digraph *G;
835 typedef GR Digraph; typedef
976 typedef typename TR::Digraph Digraph; typedef
1013 Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1037 Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1203 typedef GR Digraph; typedef
1233 typedef GR Digraph; typedef
[all …]
|
| H A D | dijkstra.h | 68 typedef GR Digraph; typedef
120 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
211 typedef typename TR::Digraph Digraph; typedef
239 typedef typename Digraph::Node Node;
241 typedef typename Digraph::Arc Arc;
245 const Digraph *G;
935 typedef GR Digraph; typedef
989 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
1108 typedef typename TR::Digraph Digraph; typedef
1148 Dijkstra<Digraph,LengthMap,TR> in run()
[all …]
|
| /dports/math/lemon/lemon-1.3.1/lemon/ |
| H A D | connectivity.h | 264 template <typename Digraph>
266 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnected()
331 checkConcept<concepts::Digraph, Digraph>(); in countStronglyConnectedComponents()
408 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnectedComponents()
476 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnectedCutArcs()
573 const Digraph& _graph;
1294 checkConcept<concepts::Digraph, Digraph>(); in dag()
1343 checkConcept<concepts::Digraph, Digraph>(); in topologicalSort()
1353 DfsVisit<Digraph, TopologicalSortVisitor<Digraph, NodeMap> > in topologicalSort()
1385 checkConcept<concepts::Digraph, Digraph>(); in checkedTopologicalSort()
[all …]
|
| H A D | dfs.h | 43 typedef GR Digraph; typedef
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
141 typedef typename TR::Digraph Digraph; typedef
166 const Digraph *G;
765 typedef GR Digraph; typedef
906 typedef typename TR::Digraph Digraph; typedef
943 Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
967 Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1133 typedef GR Digraph; typedef
1171 typedef GR Digraph; typedef
[all …]
|
| H A D | bfs.h | 43 typedef GR Digraph; typedef
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
141 typedef typename TR::Digraph Digraph; typedef
166 const Digraph *G;
835 typedef GR Digraph; typedef
976 typedef typename TR::Digraph Digraph; typedef
1013 Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1037 Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1203 typedef GR Digraph; typedef
1233 typedef GR Digraph; typedef
[all …]
|
| H A D | dijkstra.h | 68 typedef GR Digraph; typedef
120 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
211 typedef typename TR::Digraph Digraph; typedef
239 typedef typename Digraph::Node Node;
241 typedef typename Digraph::Arc Arc;
245 const Digraph *G;
935 typedef GR Digraph; typedef
989 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
1108 typedef typename TR::Digraph Digraph; typedef
1148 Dijkstra<Digraph,LengthMap,TR> in run()
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/ |
| H A D | euler_test.cc | 26 template <typename Digraph>
27 void checkDiEulerIt(const Digraph& g, in checkDiEulerIt()
32 DiEulerIt<Digraph> e(g, start); in checkDiEulerIt()
86 typedef ListDigraph Digraph; in main() typedef
90 Digraph d; in main()
101 Digraph d; in main()
114 Digraph d; in main()
127 Digraph d; in main()
149 Digraph d; in main()
185 Digraph d; in main()
[all …]
|
| /dports/math/lemon/lemon-1.3.1/test/ |
| H A D | euler_test.cc | 26 template <typename Digraph>
27 void checkDiEulerIt(const Digraph& g, in checkDiEulerIt()
32 DiEulerIt<Digraph> e(g, start); in checkDiEulerIt()
86 typedef ListDigraph Digraph; in main() typedef
90 Digraph d; in main()
101 Digraph d; in main()
114 Digraph d; in main()
127 Digraph d; in main()
149 Digraph d; in main()
185 Digraph d; in main()
[all …]
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/ |
| H A D | dfs.h | 43 typedef GR Digraph; typedef
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
141 typedef typename TR::Digraph Digraph; typedef
166 const Digraph *G;
765 typedef GR Digraph; typedef
906 typedef typename TR::Digraph Digraph; typedef
943 Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
967 Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1133 typedef GR Digraph; typedef
1171 typedef GR Digraph; typedef
[all …]
|
| H A D | connectivity.h | 264 template <typename Digraph>
266 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnected()
330 checkConcept<concepts::Digraph, Digraph>(); in countStronglyConnectedComponents()
405 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnectedComponents()
473 checkConcept<concepts::Digraph, Digraph>(); in stronglyConnectedCutArcs()
570 const Digraph& _graph;
1291 checkConcept<concepts::Digraph, Digraph>(); in dag()
1340 checkConcept<concepts::Digraph, Digraph>(); in topologicalSort()
1348 DfsVisit<Digraph, TopologicalSortVisitor<Digraph, NodeMap> > in topologicalSort()
1380 checkConcept<concepts::Digraph, Digraph>(); in checkedTopologicalSort()
[all …]
|
| H A D | bfs.h | 43 typedef GR Digraph; typedef
51 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
141 typedef typename TR::Digraph Digraph; typedef
166 const Digraph *G;
835 typedef GR Digraph; typedef
976 typedef typename TR::Digraph Digraph; typedef
1013 Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1037 Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); in run()
1203 typedef GR Digraph; typedef
1233 typedef GR Digraph; typedef
[all …]
|
| H A D | dijkstra.h | 68 typedef GR Digraph; typedef
120 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
211 typedef typename TR::Digraph Digraph; typedef
239 typedef typename Digraph::Node Node;
241 typedef typename Digraph::Arc Arc;
245 const Digraph *G;
935 typedef GR Digraph; typedef
989 typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
1108 typedef typename TR::Digraph Digraph; typedef
1148 Dijkstra<Digraph,LengthMap,TR> in run()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 41 Digraph; in concept_checks() typedef
42 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
43 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
45 function_requires< GraphConcept<Digraph> >(); in concept_checks()
46 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
47 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
50 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
76 Digraph g; in concept_checks()
87 Digraph; in test_main() typedef
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 41 Digraph; in concept_checks() typedef
42 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
43 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
45 function_requires< GraphConcept<Digraph> >(); in concept_checks()
46 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
47 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
50 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
76 Digraph g; in concept_checks()
87 Digraph; in test_main() typedef
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 40 Digraph; in concept_checks() typedef
41 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
42 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
44 function_requires< GraphConcept<Digraph> >(); in concept_checks()
45 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
46 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
48 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
75 Digraph g; in concept_checks()
86 Digraph; in test_main() typedef
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 40 Digraph; in concept_checks() typedef
41 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
42 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
44 function_requires< GraphConcept<Digraph> >(); in concept_checks()
45 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
46 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
48 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
75 Digraph g; in concept_checks()
86 Digraph; in test_main() typedef
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 40 Digraph; in concept_checks() typedef
41 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
42 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
44 function_requires< GraphConcept<Digraph> >(); in concept_checks()
45 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
46 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
48 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
75 Digraph g; in concept_checks()
86 Digraph; in test_main() typedef
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 40 Digraph; in concept_checks() typedef
41 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
42 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
44 function_requires< GraphConcept<Digraph> >(); in concept_checks()
45 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
46 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
48 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
75 Digraph g; in concept_checks()
86 Digraph; in test_main() typedef
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 41 Digraph; in concept_checks() typedef
42 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
43 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
45 function_requires< GraphConcept<Digraph> >(); in concept_checks()
46 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
47 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
50 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
76 Digraph g; in concept_checks()
87 Digraph; in test_main() typedef
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 40 Digraph; in concept_checks() typedef
41 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
42 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
44 function_requires< GraphConcept<Digraph> >(); in concept_checks()
45 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
46 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
48 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
75 Digraph g; in concept_checks()
86 Digraph; in test_main() typedef
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph_parallel/test/ |
| H A D | distributed_csr_test.cpp | 41 Digraph; in concept_checks() typedef
42 typedef graph_traits<Digraph>::vertex_descriptor vertex_descriptor; in concept_checks()
43 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks()
45 function_requires< GraphConcept<Digraph> >(); in concept_checks()
46 function_requires< IncidenceGraphConcept<Digraph> >(); in concept_checks()
47 function_requires< AdjacencyGraphConcept<Digraph> >(); in concept_checks()
49 function_requires< DistributedVertexListGraphConcept<Digraph> >(); in concept_checks()
50 function_requires< DistributedEdgeListGraphConcept<Digraph> >(); in concept_checks()
76 Digraph g; in concept_checks()
87 Digraph; in test_main() typedef
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/tst/standard/ |
| H A D | prop.tst | 44 gap> gr1 := Digraph([]);
48 gap> gr2 := Digraph([[]]);
55 gap> gr3 := Digraph(r);
62 gap> gr4 := Digraph(r);
122 gap> grid := Digraph(r);
163 gap> gr := Digraph([
182 gap> gr := Digraph([]);
195 gap> g1 := Digraph(r);
360 gap> gr := Digraph(r);
398 gap> gr := Digraph(r);
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/bits/ |
| H A D | path_dump.h | 32 typedef _Digraph Digraph; typedef
33 typedef typename Digraph::Arc Arc;
43 typename Digraph::Arc arc; in length()
88 typename Digraph::Node current;
92 const Digraph& digraph;
94 typename Digraph::Node target;
103 typedef _Digraph Digraph; typedef
117 typename Digraph::Arc arc; in length()
169 const Digraph& digraph;
171 typename Digraph::Node source;
[all …]
|