Hi, I am working on skeleton based object matching and have encountered on the fallowing problem in C/C++/C#:
I need to produce a program which matches two graphs.
Input: 2 graphs in any form I want, and any constraints I need
Output: index of how similar the graphs are.
The code must be resistant in missing nodes (ex. couple of nodes are missing from one of the graph).
Since I will be comparing graphs created from proteins, I expect them to be huge and I am hoping to find an algorithm that indexes the graphs for easier matching
I will be thankful for any links, advices, and code or libraries that I can use