orbitsi 0.1.0__tar.gz → 0.1.1__tar.gz

{orbitsi-0.1.0/orbitsi.egg-info → orbitsi-0.1.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: orbitsi
-Version: 0.1.0
+Version: 0.1.1
 Summary: OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem
 Author-email: Syed Ibtisam Tauhidi <stauhidi01@qub.ac.uk>
 License: GPL-3.0-only
@@ -25,7 +25,7 @@ Dynamic: license-file
 [![C++](https://img.shields.io/badge/C%2B%2B-17%2B-brightgreen.svg)](https://en.cppreference.com/w/cpp/compiler_support)
 [![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](LICENSE)
 
-**OrbitSI** is a NetworkX-based Python package that efficiently solves the **subgraph isomorphism enumeration problem**, i.e., finding all subgraphs in a large data graph $G_d$ that are isomorphic to a pattern/query graph $G_p$. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
+**OrbitSI** is a NetworkX-based Python package that efficiently solves the **subgraph isomorphism enumeration problem**, i.e., finding all subgraphs in a large data graph <em>G</em><sub>d</sub> that are isomorphic to a pattern/query graph <em>G</em><sub>p</sub>. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
 
 OrbitSI combines orbit-based filtering and ordering to prune and order candidate node mappings, significantly reducing the search space during subgraph matching. It integrates two state-of-the-art orbit counting engines — **EVOKE** and **ORCA** — via optimised C++ bindings using `pybind11`, and builds the search pipeline using `networkx`.
 
@@ -54,7 +54,7 @@ pip install orbitsi
 1. Clone the repository:
 
 ```bash
-git clone https://github.com/yourusername/OrbitSI-nx.git
+git clone https://hpdc-gitlab.eeecs.qub.ac.uk/sitauhidi/orbitsi-nx.git
 cd orbitsi-nx
 ```
 
@@ -85,7 +85,7 @@ orbitsi --help
 
 ### Subgraph Isomorphism Search
 
-Find all subgraphs in a large graph $G_d$ that are isomorphic to a smaller query/pattern graph $G_p$.
+Find all subgraphs in a large graph <em>G</em><sub>d</sub> that are isomorphic to a smaller query/pattern graph <em>G</em><sub>p</sub>.
 
 ###### **Command:**
 

{orbitsi-0.1.0 → orbitsi-0.1.1}/README.md

@@ -4,7 +4,7 @@
 [![C++](https://img.shields.io/badge/C%2B%2B-17%2B-brightgreen.svg)](https://en.cppreference.com/w/cpp/compiler_support)
 [![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](LICENSE)
 
-**OrbitSI** is a NetworkX-based Python package that efficiently solves the **subgraph isomorphism enumeration problem**, i.e., finding all subgraphs in a large data graph $G_d$ that are isomorphic to a pattern/query graph $G_p$. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
+**OrbitSI** is a NetworkX-based Python package that efficiently solves the **subgraph isomorphism enumeration problem**, i.e., finding all subgraphs in a large data graph <em>G</em><sub>d</sub> that are isomorphic to a pattern/query graph <em>G</em><sub>p</sub>. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
 
 OrbitSI combines orbit-based filtering and ordering to prune and order candidate node mappings, significantly reducing the search space during subgraph matching. It integrates two state-of-the-art orbit counting engines — **EVOKE** and **ORCA** — via optimised C++ bindings using `pybind11`, and builds the search pipeline using `networkx`.
 
@@ -33,7 +33,7 @@ pip install orbitsi
 1. Clone the repository:
 
 ```bash
-git clone https://github.com/yourusername/OrbitSI-nx.git
+git clone https://hpdc-gitlab.eeecs.qub.ac.uk/sitauhidi/orbitsi-nx.git
 cd orbitsi-nx
 ```
 
@@ -64,7 +64,7 @@ orbitsi --help
 
 ### Subgraph Isomorphism Search
 
-Find all subgraphs in a large graph $G_d$ that are isomorphic to a smaller query/pattern graph $G_p$.
+Find all subgraphs in a large graph <em>G</em><sub>d</sub> that are isomorphic to a smaller query/pattern graph <em>G</em><sub>p</sub>.
 
 ###### **Command:**
 

{orbitsi-0.1.0 → orbitsi-0.1.1/orbitsi.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: orbitsi
-Version: 0.1.0
+Version: 0.1.1
 Summary: OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem
 Author-email: Syed Ibtisam Tauhidi <stauhidi01@qub.ac.uk>
 License: GPL-3.0-only
@@ -25,7 +25,7 @@ Dynamic: license-file
 [![C++](https://img.shields.io/badge/C%2B%2B-17%2B-brightgreen.svg)](https://en.cppreference.com/w/cpp/compiler_support)
 [![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](LICENSE)
 
-**OrbitSI** is a NetworkX-based Python package that efficiently solves the **subgraph isomorphism enumeration problem**, i.e., finding all subgraphs in a large data graph $G_d$ that are isomorphic to a pattern/query graph $G_p$. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
+**OrbitSI** is a NetworkX-based Python package that efficiently solves the **subgraph isomorphism enumeration problem**, i.e., finding all subgraphs in a large data graph <em>G</em><sub>d</sub> that are isomorphic to a pattern/query graph <em>G</em><sub>p</sub>. It also supports fast vertex orbit counting, which summarises the local structural roles of vertices within a network.
 
 OrbitSI combines orbit-based filtering and ordering to prune and order candidate node mappings, significantly reducing the search space during subgraph matching. It integrates two state-of-the-art orbit counting engines — **EVOKE** and **ORCA** — via optimised C++ bindings using `pybind11`, and builds the search pipeline using `networkx`.
 
@@ -54,7 +54,7 @@ pip install orbitsi
 1. Clone the repository:
 
 ```bash
-git clone https://github.com/yourusername/OrbitSI-nx.git
+git clone https://hpdc-gitlab.eeecs.qub.ac.uk/sitauhidi/orbitsi-nx.git
 cd orbitsi-nx
 ```
 
@@ -85,7 +85,7 @@ orbitsi --help
 
 ### Subgraph Isomorphism Search
 
-Find all subgraphs in a large graph $G_d$ that are isomorphic to a smaller query/pattern graph $G_p$.
+Find all subgraphs in a large graph <em>G</em><sub>d</sub> that are isomorphic to a smaller query/pattern graph <em>G</em><sub>p</sub>.
 
 ###### **Command:**
 

{orbitsi-0.1.0 → orbitsi-0.1.1}/pyproject.toml

@@ -8,7 +8,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "orbitsi"
-version = "0.1.0"
+version = "0.1.1"
 description = "OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem"
 authors = [
     { name = "Syed Ibtisam Tauhidi", email = "stauhidi01@qub.ac.uk" }