[igraph] Maximum Common Subgraph

[Mark Galea]

Hi there,

I am trying to find to get the maximum common subgraph given two
graphs however I cannot seem to find this in the library.  Am I
missing something?

Given that Graph 1 is

A - B
A - C
B - D
D - E

Graph 2 is

A - B
A - E
B - D

Than the algorithm should return
A - B
B - D

Sub-isomorphism is not taking into account the unique node labels.  Is
there a way to do this? It is a bit odd that such a functionality is
not provided.

Regards ,

Mark