I want to solve the problem of isomorphism of a subgraph. I have one big graph. Nodes and edges repeat the labels, and the graph also has loops. I want to identify all occurrences of a subgraph in a large graph.
Please offer me any pseudo code in Java.
Can VF2 solve this problem, if yes, then indicate any link from where I can understand the basic functions of the VF2 algorithm
Please offer me the ant link, from where I can understand the basic functions of the VF2 algorithm.
source
share