[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Maximum Common Subgraph

From: Tamas Nepusz
Subject: Re: [igraph] Maximum Common Subgraph
Date: Fri, 11 Mar 2011 16:58:37 +0100
User-agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv: Gecko/20110223 Lightning/1.0b2 Thunderbird/3.1.8

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. 

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.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]