| /dports/math/R-cran-igraph/igraph/man/ |
| H A D | isomorphic.Rd | 3 \name{isomorphic}
4 \alias{isomorphic}
5 \alias{graph.isomorphic}
6 \alias{graph.isomorphic.34}
7 \alias{graph.isomorphic.vf2}
8 \alias{graph.isomorphic.bliss}
36 Decide if two graphs are isomorphic
103 isomorphic(g1, g2)
109 isomorphic(g1, g2)
111 isomorphic(g1, g2, method = "vf2")
[all …]
|
| H A D | count_isomorphisms.Rd | 6 \title{Count the number of isomorphic mappings between two graphs}
16 \code{\link{isomorphic}} for details about it and extra arguments.}
21 Number of isomorphic mappings between the two graphs.
24 Count the number of isomorphic mappings between two graphs
30 isomorphic(g1, g2)
49 \code{\link{isomorphic}()},
|
| H A D | isomorphism_class.Rd | 23 class are isomorphic and isomorphic graphs always have the same
28 # create some non-isomorphic graphs
33 isomorphic(g1, g2)
40 \code{\link{isomorphic}()},
|
| H A D | isomorphisms.Rd | 6 \title{Calculate all isomorphic mappings between the vertices of two graphs}
16 \code{\link{isomorphic}} for details about it and extra arguments.}
25 Calculate all isomorphic mappings between the vertices of two graphs
32 \code{\link{isomorphic}()},
|
| H A D | graph_from_isomorphism_class.Rd | 24 class are isomorphic and isomorphic graphs always have the same
32 \code{\link{isomorphic}()},
|
| H A D | count_subgraph_isomorphisms.Rd | 6 \title{Count the isomorphic mappings between a graph and the subgraphs of
27 isomorphic to a (possibly induced) subgraph of \code{target}.
30 Count the isomorphic mappings between a graph and the subgraphs of
83 \code{\link{isomorphic}()},
|
| /dports/math/polymake/polymake-4.5/apps/graph/cpperl/ |
| H A D | auto-isomorphic.cpperl | 3 …aph<Undirected>&>"], "func": "isomorphic", "include": ["polymake/Graph.h", "polymake/graph/compare…
4 …Symmetric>&>"], "func": "isomorphic", "include": ["polymake/IncidenceMatrix.h", "polymake/graph/co…
5 …Graph<Directed>&>"], "func": "isomorphic", "include": ["polymake/Graph.h", "polymake/graph/compare…
|
| /dports/textproc/py-rdflib/rdflib-5.0.0/test/ |
| H A D | test_issue381.py | 2 from rdflib.compare import isomorphic
20 assert isomorphic(got, expected), got.serialize(format="turtle")
36 assert isomorphic(got, expected), got.serialize(format="turtle")
52 assert isomorphic(got, expected), got.serialize(format="turtle")
68 assert isomorphic(got, expected), got.serialize(format="turtle")
84 assert isomorphic(got, expected), got.serialize(format="turtle")
107 assert isomorphic(got, expected), got.serialize(format="turtle")
125 assert isomorphic(got, expected), got.serialize(format="turtle")
|
| H A D | test_turtle_w3c.py | 6 from rdflib.compare import graph_diff, isomorphic
44 assert isomorphic(g, res), 'graphs must be the same'
|
| H A D | test_trig_w3c.py | 7 from rdflib.compare import graph_diff, isomorphic
55 assert isomorphic(g, res), 'graphs must be the same'
|
| /dports/textproc/kibana7/kibana-7.16.2-darwin-x86_64/node_modules/isomorphic-fetch/ |
| H A D | README.md | 1 isomorphic-fetch [;
|
| /dports/textproc/kibana6/kibana-6.8.16-darwin-x86_64/node_modules/isomorphic-fetch/ |
| H A D | README.md | 1 isomorphic-fetch [;
|
| /dports/math/R-cran-igraph/igraph/tests/testthat/ |
| H A D | test-isomorphism.R | 7 expect_true(isomorphic(g, g))
8 expect_true(isomorphic(g, g, method = "direct"))
9 expect_true(isomorphic(g, g, method = "vf2"))
10 expect_true(isomorphic(g, g, method = "bliss"))
13 expect_false(isomorphic(g, g2))
14 expect_false(isomorphic(g, g2, method = "direct"))
15 expect_false(isomorphic(g, g2, method = "vf2"))
16 expect_false(isomorphic(g, g2, method = "bliss"))
|
| /dports/math/polymake/polymake-4.5/apps/polytope/src/ |
| H A D | isomorphic_polytopes.cc | 24 bool isomorphic(BigObject p1, BigObject p2) in isomorphic() function
27 return graph::isomorphic(M1, M2); in isomorphic()
33 return graph::isomorphic(M, T(M)); in is_self_dual()
55 &isomorphic, "isomorphic(Cone,Cone)");
|
| /dports/math/py-pynauty/pynauty-1.0.2/src/pynauty/tests/ |
| H A D | test_isomorphic.py | 5 from pynauty import isomorphic, delete_random_edge, Version, canon_label
17 assert isomorphic(g,x)
21 assert not isomorphic(g,x)
|
| /dports/math/polymake/polymake-4.5/apps/topaz/src/ |
| H A D | isomorphic_complexes.cc | 24 bool isomorphic(BigObject p1, BigObject p2) in isomorphic() function
34 return graph::isomorphic(M1, M2); in isomorphic()
57 &isomorphic, "isomorphic($$)");
|
| /dports/math/gap/gap-4.11.0/pkg/RepnDecomp-1.1.0/tst/ |
| H A D | repndecomp02.tst | 16 gap> # rho and tau are isomorphic - they just have a different block order
19 gap> # tau2 is just tau with a basis change - still isomorphic
37 gap> # two distinct irreps are not isomorphic
49 > # Some isomorphic representations
60 > # If two representations are isomorphic, the following is always true:
|
| /dports/math/spot/spot-2.10.2/tests/core/ |
| H A D | isomorph.test | 36 run 0 autfilt all --are-isomorphic iso$i --hoa
107 run 0 autfilt aut1 --are-isomorphic aut2
108 run 0 autfilt aut3 --are-isomorphic aut4
115 test 0 = `autfilt -c --are-isomorphic aut1 aut2`
|
| /dports/math/py-spot/spot-2.10.2/tests/core/ |
| H A D | isomorph.test | 36 run 0 autfilt all --are-isomorphic iso$i --hoa
107 run 0 autfilt aut1 --are-isomorphic aut2
108 run 0 autfilt aut3 --are-isomorphic aut4
115 test 0 = `autfilt -c --are-isomorphic aut1 aut2`
|
| /dports/math/polymake/polymake-4.5/apps/graph/rules/ |
| H A D | compare.rules | 22 # true if //IncidenceMatrix1// and //IncidenceMatrix2// are isomorphic.
31 # > print isomorphic($I1,$I2);
33 user_function isomorphic(IncidenceMatrix, IncidenceMatrix) : c++ (include => "polymake/graph/compar…
36 # true if //graph1// and //graph2// are isomorphic.
45 # > print isomorphic($g1,$g2);
47 user_function isomorphic(GraphAdjacency, GraphAdjacency) : c++ (include => "polymake/graph/compare.…
53 # @return Array<Int> permutation of node indexes, or undef if graphs are not isomorphic
63 # or undef if matrices are not isomorphic
|
| /dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/doc/tut/ |
| H A D | plnr.tex | 71 isomorphic to the quaternion group with 8 elements. Let's try the latter.
91 isomorphic to the quaternion group are conjugate. Now, we have our Ferrero
105 may yield isomorphic nearrings. The function
116 orbit representative are in fact isomorphic.
124 We obtain $2$ non-isomorphic planar near-rings. Let's just construct one of
133 How many non-isomorphic planar nearrings can be defined from our Ferrero pair
142 Summing all up, we get exactly $9$ non-isomorphic planar nearrings with
|
| /dports/math/gap/gap-4.11.0/pkg/sophus-1.24/gap/ |
| H A D | test.gi | 79 Print( "the same algebras should be isomorphic\n" );
84 Print( "these algebras should be non-isomorphic\n" );
141 Print( "the same algebras should be isomorphic\n" );
146 Print( "these algebras should be non-isomorphic\n" );
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.ui/org.eclipse.jdt.core.manipulation/core extension/org/eclipse/jdt/internal/corext/dom/ |
| H A D | JdtASTMatcher.java | 28 boolean isomorphic= super.match(node, other); in match()
29 if (! isomorphic || !(other instanceof SimpleName)) in match()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/testing/web-platform/tests/annotation-vocab/tools/ruby-rdf/ |
| H A D | Gemfile.lock | 66 rdf-isomorphic (~> 2.0)
91 rdf-isomorphic (2.0.0)
115 rdf-isomorphic (~> 2.0)
|
| /dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/lib/ |
| H A D | grpsupp.gd | 3 #O IsIsomorphicGroup( <G>, <H> ) . . Check if two groups G, H are isomorphic
5 ## The return value is 'false' iff G and H are not isomorphic
58 #O AsPermGroup ( <G> ) returns an isomorphic Permutation Group
|