Home
last modified time | relevance | path

Searched refs:isomorphism (Results 1 – 15 of 15) sorted by relevance

/third_party/boost/libs/graph/doc/
DMakefile61 JWEB = isomorphism-impl.w isomorphism-impl-v3.w
67 default: isomorphism-impl-v3.$(RESULT)
69 final: isomorphism-impl-v3.$(RESULT)
70 $(LATEX) isomorphism-impl-v3
72 $(LATEX) isomorphism-impl-v3
79 isomorphism-impl-v3.dvi: $(DOT) $(EPS_GEN) $(WEBTEX)
80 isomorphism-impl-v3.ps: isomorphism-impl-v3.dvi
81 isomorphism-impl-v3.pdf: $(EPS_GEN) $(PDFPICT) $(WEBTEX)
83 isomorphism-v3.hpp: isomorphism-impl-v3.w isomorphism-impl-v3.tex
85 out.dot: isomorphism-impl.tex
[all …]
Disomorphism-impl.w44 …-np isomorphism-impl.w; dot -Tps out.dot -o out.eps; dot -Tps in.dot -o in.eps; latex isomorphism-…
64 This paper documents the implementation of the \code{isomorphism()}
67 The \code{isomorphism()} function answers the question, ``are these
73 An \emph{isomorphism} is a one-to-one mapping of the vertices in one
76 $G_{2} = (V_{2},E_{2})$, an isomorphism is a function $f$ such that
81 graph $G_1$ is \emph{isomorphic} to $G_2$ if an isomorphism exists
98 The algorithm used by the \code{isomorphism()} function is, at
117 stage of the recursion we start with an isomorphism $f_{k-1}$ between
121 $G_1$. We try to extend the isomorphism by finding a vertex $v \in V_2
123 have a new isomorphism $f_k$ with $G_1[k] \isomorphic G_2[S \union \{
[all …]
Disomorphism-impl-v2.w55 This paper documents the implementation of the \code{isomorphism()}
58 and Brian Osman. The \code{isomorphism()} function answers the
62 equality is \emph{isomorphism}.
64 More precisely, an \emph{isomorphism} is a one-to-one mapping of the
67 (V_{1},E_{1})$ and $G_{2} = (V_{2},E_{2})$, an isomorphism is a
73 graph $G_1$ is \emph{isomorphic} to $G_2$ if an isomorphism exists
91 The algorithm used by the \code{isomorphism()} function is, at
128 of the isomorphism between subgraphs $G_1[k]$ and $G_2[S]$. At this
192 start with an isomorphism $f_{k-1}$ between $G_1[k-1]$ and a subgraph
201 We try to extend the isomorphism by finding a vertex $v \in V_2 - S$
[all …]
Disomorphism-impl-v3.w77 This paper documents the implementation of the \code{isomorphism()}
80 and Brian Osman. The \code{isomorphism()} function answers the
84 equality is \emph{isomorphism}.
86 More precisely, an \emph{isomorphism} is a one-to-one mapping of the
89 (V_{1},E_{1})$ and $G_{2} = (V_{2},E_{2})$, an isomorphism is a
94 The graph $G_1$ is \emph{isomorphic} to $G_2$ if an isomorphism exists
109 The algorithm used by the \code{isomorphism()} function is, at first
182 extension of the isomorphism to $k$. At this point we are guaranteed
210 such that $i(v) = i(v')$ if there exists some isomorphism $f$ where
376 we can now consider extending the isomorphism. We need to find a match
[all …]
Deg1-iso.cpp110 bool ret = isomorphism(Ga, Gb, &f[0], invariantA, invariantB, in test_isomorphism()
/third_party/boost/libs/graph/example/
Disomorphism.cpp78 bool ret = isomorphism(g1, g2, in main()
83 bool ret = isomorphism(g1, g2, in main()
Dregression.cfg63 compile libs/graph/example/isomorphism.cpp
DJamfile.v298 run isomorphism.cpp ;
/third_party/boost/boost/graph/
Disomorphism.hpp488 bool isomorphism(const Graph1& G1, const Graph2& G2, IsoMapping f, in isomorphism() function
574 return isomorphism(G1, G2, f, in isomorphism_impl()
651 return boost::isomorphism(g1, g2, in operator ()()
662 BOOST_GRAPH_MAKE_FORWARDING_FUNCTION(isomorphism, 2, 6)
666 BOOST_GRAPH_MAKE_OLD_STYLE_PARAMETER_FUNCTION(isomorphism, 2)
Dis_kuratowski_subgraph.hpp278 return boost::isomorphism(K_5, contracted_graph); in is_kuratowski_subgraph()
282 return boost::isomorphism(K_3_3, contracted_graph); in is_kuratowski_subgraph()
Dvf2_sub_graph_iso.hpp416 isomorphism enumerator
467 boost::mpl::int_< isomorphism >) const in comp_term_sets()
1210 GraphIsoMapCallback, detail::isomorphism > in vf2_graph_iso()
/third_party/boost/libs/graph/test/
Disomorphism.cpp145 BOOST_TEST(isomorphism_correct = boost::graph::isomorphism(g1, g2, in test_isomorphism2()
208 BOOST_TEST(isomorphism_correct = boost::graph::isomorphism(g1, g2, in test_isomorphism()
DJamfile.v292 [ run isomorphism.cpp ]
/third_party/boost/libs/spirit/doc/x3/abstracts/
Dsyntax_diagram.qbk20 isomorphism of the diagrams and functions make them ideal for representing
/third_party/boost/libs/spirit/doc/abstracts/
Dsyntax_diagram.qbk20 charts. The isomorphism of the diagrams and functions make them ideal for