|
From: | Mark Galea |
Subject: | Re: [igraph] Maximum Common Subgraph |
Date: | Fri, 11 Mar 2011 18:33:40 +0000 |
g2 = Graph.Formula("A--B, A--C")
Well, I don't expect to find it; the mapping [1, 0] would mean that vertex 0 of the second graph maps to vertex 1 of the first graph and vertex 1 of the second graph maps to vertex 0 of the first graph. Considering that graphs g and g2 have only one vertex in common (that has the same name, i.e. "B"), I wouldn't expect any subisomorphisms between the two graphs.
g = Graph.Formula("A-B-D-E")
g2 = Graph.Formula("B-C")
[...]
Clearly we are expecting to find the mapping [1,0] Referring to the mapping B from the first graph to B onto the second graph. Am I missing something.
--
Tamas
[Prev in Thread] | Current Thread | [Next in Thread] |