VF2子图同构 [英] VF2 Subgraph Isomorphism

问题描述

我想解决子图同构问题。我有一个大图。节点和边具有重复标签，并且图中也包含循环。我想在大图中标识所有出现的子图。

请在Java中给我任何伪代码。

VF2可以解决这个问题，如果是的话请提及任何可以了解VF2算法基本功能的链接。

我可以理解VF2算法的基本功能。

它包含了VF2的一个很好的实现。

• https：/ /github.com/fozziethebeat/S-Space

VF2算法如下：

• https://github.com/fozziethebeat/S-Space/tree/master/src/main/java/edu/ucla/sspace/graph/isomorphism
>

I want to solve the subgraph isomorphism problem. I have one large graph. Nodes and edges has repeating labels and graph also has loops in it. I want to identify the all occurrences of subgraph in the large graph.

Please suggest me any pseudo code in Java.

Is VF2 can resolve this problem, if yes then please mention any link from where I can understand the basic functionality of the VF2 algorithm

Please suggest me ant link from where I can understand the basic functionality of the VF2 algorithm.

解决方案

Try the implementation used by the S-Space project.

It contains a good implementation of VF2.

• https://github.com/fozziethebeat/S-Space

The VF2 algorithm is here:

• https://github.com/fozziethebeat/S-Space/tree/master/src/main/java/edu/ucla/sspace/graph/isomorphism

这篇关于VF2子图同构的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！