OrbitSI is an open-source Python framework designed to efficiently solve the subgraph isomorphism enumeration problem, i.e., identifying all subgraphs within a data graph that are structurally identical to a given pattern graph. The tool introduces an orbit-aware pruning and ordering strategy that significantly improves enumeration speed compared to classical algorithms. OrbitSI enhances computational performance by integrating structural information about node roles, referred to as orbits, to prune the search space before enumeration. It is built atop NetworkX and C++ backends such as EVOKE and ORCA. The framework supports both command-line and Python interfaces, enabling researchers and practitioners to perform subgraph searches and orbit counting tasks with ease. It is distributed under the Apache 2.0 License.

Check out OrbitSI on Github: https://github.com/ibtisamtauhidi/OrbitSI

Install through PyPi: https://pypi.org/project/orbitsi/