Welcome to VF3Py’s documentation!

Interfacing Python and NetworkX with VF3 – the fastest algorithm for graph/subgraph isomorphism calculation.

Contents:

• Purpose of the project
• Installation
• Usage
  • VF3Py cheat sheet
  • Supported types of graphs
  • Node & edge attributes
  • Limitations
• Detailed reference
  • Module contents
    • ApplicabilityScopeError
    • are_isomorphic()
    • get_automorphisms()
    • get_exact_isomorphisms()
    • get_subgraph_isomorphisms()
    • has_subgraph()
    • main_vf3_caller()
  • Submodules
  • vf3py.vf3py_base module
    • calc_bothattrs()
    • calc_edgeattr()
    • calc_noattrs()
    • calc_nodeattr()
• Build from source
  • Build for single user
  • Build release for PyPi
    • Linux
    • Windows
    • Completing and uploading the release

Links

VF3py GitLab page	VF3py PyPi page	The original implementation of VF3 algorithm

References

References on the original VF3 algorithm:

1. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3 - Carletti V., Foggia P., Saggese A., Vento M. - IEEE transactions on pattern analysis and machine intelligence - 2018

2. Introducing VF3: A new algorithm for subgraph isomorphism - Carletti V., Foggia P., Saggese A., Vento M. - International Workshop on Graph-Based Representations in Pattern Recognition - 2017

3. Comparing performance of graph matching algorithms on huge graphs - Carletti V., Foggia P., Saggese A., Vento M. - Pattern Recognition Letters - 2018

4. A Parallel Algorithm for Subgraph Isomorphism - V. Carletti, P. Foggia, P. Ritrovato, M. Vento, V. Vigilante - International Workshop on Graph-Based Representations in Pattern Recognition - 2019