Home
last modified time | relevance | path

Searched refs:digraph (Results 1 – 25 of 2909) sorted by relevance

12345678910>>...117

/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/lang/erlang/otp-OTP-24.1.7/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/stdlib/test/
H A Ddigraph_SUITE.erl77 digraph:delete(G4),
80 digraph:delete(G5),
84 digraph:delete(G6),
118 digraph:delete(G),
140 digraph:delete(G),
159 digraph:delete(G),
171 digraph:delete(G),
192 digraph:delete(G),
214 digraph:delete(G),
227 G = digraph:new(),
[all …]
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/tst/standard/
H A Dgrape.tst25 gap> IsCayleyDigraph(digraph);
27 gap> IsDigraph(digraph);
44 gap> HasDigraphGroup(digraph);
46 gap> digraph := DigraphCopy(digraph);
48 gap> HasDigraphGroup(digraph);
51 gap> digraph := DigraphAddEdgeOrbit(digraph, [4, 3]);
53 gap> Graph(digraph);
65 gap> digraph := DigraphCopy(digraph);
70 gap> digraph := DigraphRemoveEdgeOrbit(digraph, [1, 3]);
74 gap> Graph(digraph);
[all …]
H A Dconstructors.tst26 <immutable digraph with 5 vertices, 5 edges>
37 gap> digraph := Digraph(out);
38 <immutable digraph with 4 vertices, 3 edges>
39 gap> SetDigraphGroup(digraph, group);
41 <immutable digraph with 8 vertices, 6 edges>
44 gap> ddigraph := DoubleDigraph(digraph);
101 gap> digraph := Digraph(out);
103 gap> DigraphDiameter(digraph);
105 gap> DistanceDigraph(digraph, 4);
107 gap> DistanceDigraph(digraph, [1, 3, 5]);
[all …]
H A Dprop.tst45 <immutable empty digraph with 0 vertices>
49 <immutable empty digraph with 1 vertex>
73 <immutable digraph with 1 vertex, 1 edge>
183 <immutable empty digraph with 0 vertices>
323 <immutable empty digraph with 1 vertex>
482 <immutable empty digraph with 1 vertex>
520 <immutable empty digraph with 1 vertex>
546 <immutable empty digraph with 1 vertex>
889 <immutable empty digraph with 1 vertex>
951 <immutable empty digraph with 1 vertex>
[all …]
H A Dexamples.tst22 <mutable digraph with 10 vertices, 30 edges>
60 <immutable empty digraph with 0 vertices>
68 <immutable empty digraph with 5 vertices>
72 <immutable empty digraph with 0 vertices>
83 <immutable digraph with 1 vertex, 1 edge>
94 <mutable digraph with 6 vertices, 6 edges>
101 <immutable empty digraph with 1 vertex>
107 <immutable chain digraph with 2 vertices>
206 <immutable empty digraph with 1 vertex>
208 <immutable empty digraph with 1 vertex>
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/tests/org.eclipse.core.tests.resources/src/org/eclipse/core/tests/internal/builders/
H A DComputeProjectOrderTest.java38 digraph.freeze(); in testComputeVertexOrderDuration()
95 digraph.addVertex(a);
96 digraph.addVertex(b);
98 digraph.addVertex(c);
100 digraph.addVertex(d);
102 digraph.addVertex(e);
104 digraph.addVertex(f);
127 digraph.addVertex(a);
128 digraph.addVertex(b);
129 digraph.addVertex(c);
[all …]
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/lang/erlang/otp-OTP-24.1.7/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/stdlib/src/
H A Ddigraph_utils.erl47 Digraph :: digraph:graph(),
54 Digraph :: digraph:graph(),
61 Digraph :: digraph:graph(),
68 Digraph :: digraph:graph(),
76 Digraph :: digraph:graph(),
84 Digraph :: digraph:graph(),
118 Root :: digraph:vertex().
121 case digraph:no_edges(G) =:= digraph:no_vertices(G) - 1 of
149 (digraph:no_edges(G) =:= digraph:no_vertices(G) - 1)
317 Info = digraph:info(G),
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/rt.equinox.bundles/bundles/org.eclipse.equinox.region.tests/src/org/eclipse/equinox/region/tests/system/
H A DRegionSystemTests.java128 …digraph.connect(digraph.getRegion(SP1), digraph.createRegionFilterBuilder().allow(RegionFilter.VIS… in testSingleBundleRegions()
130 …digraph.connect(digraph.getRegion(PP2), digraph.createRegionFilterBuilder().allow(CP1, "(name=" + … in testSingleBundleRegions()
132 …digraph.connect(digraph.getRegion(SP2), digraph.createRegionFilterBuilder().allow(RegionFilter.VIS… in testSingleBundleRegions()
134 …digraph.connect(digraph.getRegion(CP2), digraph.createRegionFilterBuilder().allow(RegionFilter.VIS… in testSingleBundleRegions()
135 …digraph.connect(digraph.getRegion(CP2), digraph.createRegionFilterBuilder().allow(RegionFilter.VIS… in testSingleBundleRegions()
137 …digraph.connect(digraph.getRegion(PC1), digraph.createRegionFilterBuilder().allow(RegionFilter.VIS… in testSingleBundleRegions()
142 …digraph.connect(digraph.getRegion(SC1), digraph.createRegionFilterBuilder().allow(RegionFilter.VIS… in testSingleBundleRegions()
144 …digraph.connect(digraph.getRegion(CC1), digraph.createRegionFilterBuilder().allow(CP2, "(name=" + … in testSingleBundleRegions()
871 …sertNull("Found existing connection.", digraph.replaceConnection(digraph.getRegion(SP1), badRegion…
882 …RegionFilter existingFilter = digraph.replaceConnection(digraph.getRegion(SP1), goodRegionFilter, …
[all …]
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/tst/extreme/
H A Disomorph.tst16 # AutomorphismGroup: for a digraph, 1
20 [ <immutable empty digraph with 5 vertices>,
21 <immutable digraph with 5 vertices, 2 edges>,
22 <immutable digraph with 5 vertices, 4 edges>,
23 <immutable digraph with 5 vertices, 6 edges>,
24 <immutable digraph with 5 vertices, 8 edges>,
99 # AutomorphismGroup: for a digraph, 2
127 # AutomorphismGroup: for a digraph, 3
146 # CanonicalLabelling: for a digraph, 1
164 # CanonicalLabelling: for a digraph, 2
[all …]
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/tools/
H A Ddimacs-to-lgf.cc95 Digraph digraph; in main() local
96 DoubleArcMap lower(digraph), capacity(digraph), cost(digraph); in main()
97 DoubleNodeMap supply(digraph); in main()
99 DigraphWriter<Digraph>(digraph, os). in main()
110 Digraph digraph; in main() local
112 DoubleArcMap capacity(digraph); in main()
114 DigraphWriter<Digraph>(digraph, os). in main()
124 Digraph digraph; in main() local
126 DoubleArcMap capacity(digraph); in main()
137 Digraph digraph; in main() local
[all …]
/dports/math/lemon/lemon-1.3.1/tools/
H A Ddimacs-to-lgf.cc95 Digraph digraph; in main() local
96 DoubleArcMap lower(digraph), capacity(digraph), cost(digraph); in main()
97 DoubleNodeMap supply(digraph); in main()
99 DigraphWriter<Digraph>(digraph, os). in main()
110 Digraph digraph; in main() local
112 DoubleArcMap capacity(digraph); in main()
114 DigraphWriter<Digraph>(digraph, os). in main()
124 Digraph digraph; in main() local
126 DoubleArcMap capacity(digraph); in main()
137 Digraph digraph; in main() local
[all …]
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/src/
H A Dplanar.c46 Obj FuncIS_PLANAR(Obj self, Obj digraph) { in FuncIS_PLANAR() argument
50 Obj FuncKURATOWSKI_PLANAR_SUBGRAPH(Obj self, Obj digraph) { in FuncKURATOWSKI_PLANAR_SUBGRAPH() argument
55 Obj FuncPLANAR_EMBEDDING(Obj self, Obj digraph) { in FuncPLANAR_EMBEDDING() argument
60 Obj FuncIS_OUTER_PLANAR(Obj self, Obj digraph) { in FuncIS_OUTER_PLANAR() argument
69 Obj FuncOUTER_PLANAR_EMBEDDING(Obj self, Obj digraph) { in FuncOUTER_PLANAR_EMBEDDING() argument
99 if (CALL_1ARGS(IsDigraph, digraph) != True) { in boyers_planarity_check()
102 (Int) TNAM_OBJ(digraph), in boyers_planarity_check()
105 Obj const out = FuncOutNeighbours(0L, digraph); in boyers_planarity_check()
112 Int V = DigraphNrVertices(digraph); in boyers_planarity_check()
113 Int E = DigraphNrEdges(digraph); in boyers_planarity_check()
[all …]
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/stlplus/containers/
H A Ddigraph.tpp442 digraph<NT,AT>::digraph(void) :
450 digraph<NT,AT>::~digraph(void)
456 digraph<NT,AT>::digraph(const digraph<NT,AT>& r) :
463 digraph<NT,AT>& digraph<NT,AT>::operator=(const digraph<NT,AT>& r)
517 typename digraph<NT,AT>::iterator digraph<NT,AT>::erase(typename digraph<NT,AT>::iterator iter)
597 typename digraph<NT,AT>::iterator digraph<NT,AT>::end(void)
678 typename digraph<NT,AT>::arc_vector digraph<NT,AT>::inputs(typename digraph<NT,AT>::iterator node)
699 …typename digraph<NT,AT>::arc_vector digraph<NT,AT>::outputs(typename digraph<NT,AT>::iterator node)
895 …typename digraph<NT,AT>::iterator digraph<NT,AT>::arc_from(typename digraph<NT,AT>::arc_iterator i…
910 …typename digraph<NT,AT>::iterator digraph<NT,AT>::arc_to(typename digraph<NT,AT>::arc_iterator ite…
[all …]

12345678910>>...117