Hello @cvvergara @robe
I hope you’re doing well.
I would like to know about pgRouting’s current needs around Graph Structure Comparison Algorithms, which include Isomorphism,VF2 subgraph isomorphism, and Mcgregor Common Subgraphs. Are these algorithms something you would like to see added soon, or are other areas (like ordering, metrics, planar graph algos or routing-related functions) a higher priority right now?
From my side, I see graph structure comparison as a way to extend pgRouting’s graph analysis capabilities, for example by checking whether a given pattern graph occurs inside a larger network and supporting more advanced graph-query workflows on top of the existing functions. Within this group, I am particularly interested in VF2 subgraph isomorphism and Mcgregor Common Subgraphs. Together they provide a coherent graph-pattern workflow, where McGregor finds common subgraphs between two graphs and VF2 efficiently searches for those patterns in larger networks.
I’d really appreciate your feedback on whether this direction matches pgRouting’s priorities at the moment.
Regards,
Prashsti Asthana
Indian Institute of Technology, Roorkee