simulation-alg 0.1.7__tar.gz → 0.1.8__tar.gz

{simulation_alg-0.1.7 → simulation_alg-0.1.8}/Cargo.lock

@@ -543,7 +543,7 @@ dependencies = [
 
 [[package]]
 name = "simulation"
-version = "0.1.7"
+version = "0.1.8"
 dependencies = [
  "graph-base",
  "graph-simulation",

{simulation_alg-0.1.7 → simulation_alg-0.1.8}/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "simulation"
-version = "0.1.7"
+version = "0.1.8"
 edition = "2021"
 license = "MIT"
 description = "A Python package for simulation algorithms"

{simulation_alg-0.1.7 → simulation_alg-0.1.8}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: simulation-alg
-Version: 0.1.7
+Version: 0.1.8
 Classifier: Programming Language :: Rust
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Programming Language :: Python :: Implementation :: PyPy

{simulation_alg-0.1.7 → simulation_alg-0.1.8}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "maturin"
 
 [project]
 name = "simulation-alg"
-version = "0.1.7"
+version = "0.1.8"
 requires-python = ">=3.10"
 classifiers = [
     "Programming Language :: Rust",

{simulation_alg-0.1.7 → simulation_alg-0.1.8}/simulation.pyi

@@ -50,6 +50,7 @@ class Hyperedge:
     def desc(self) -> str: ...
     
 
+# (cluster_u, cluster_v)
 class DMatch:
     """
     D-Match for hyper simulation 
@@ -62,13 +63,16 @@ class DMatch:
     For a sematic cluster pair by `id`, we set map[(id, id)] = R as the relation, where (u_id, v_id) in R, are node's id.
     """
 
-class Delta:
+class Delta: # Delta(u, v) 
     def __init__(self) -> None: ...
     def add_sematic_cluster_pair(self, u: Node, v: Node, cluster_u: list[Hyperedge], cluster_v: list[Hyperedge]) -> int: ...
     """
     Add a sematic of (u, v), register a id of the pair that, (cluster_u, id) and (cluster_v, id) 
     """
 
+# (u, v) (cluster_u, cluster_v)
+# (u', v') 
+
 class Hypergraph:
     """
     Hypergraph class.

{simulation_alg-0.1.7 → simulation_alg-0.1.8}/src/lib.rs

@@ -11,6 +11,9 @@ fn simulation(m: &Bound<'_, PyModule>) -> PyResult<()> {
     m.add_class::<graph::hypergraph::Node>()?;
     m.add_class::<graph::hypergraph::Hyperedge>()?;
     m.add_class::<graph::hypergraph::LMatchImpl>()?;
+    m.add_class::<graph::hypergraph::DeltaPy>()?;
+    m.add_class::<graph::hypergraph::DMatchImpl>()?;
+
     m.add_function(wrap_pyfunction!(graph::networkx_graph::get_simulation_inter, m)?)?;
     m.add_function(wrap_pyfunction!(graph::networkx_graph::get_simulation_inter_fn, m)?)?;
     m.add_function(wrap_pyfunction!(graph::networkx_graph::is_simulation_isomorphic, m)?)?;

simulation_alg-0.1.8/test.py

@@ -0,0 +1,57 @@
+import simulation
+
+from simulation import *
+query = Hypergraph()
+query.add_node("a") # id 0
+query.add_node("b") # id 1
+query.add_node("c") # id 2
+query.add_hyperedge(Hyperedge({0, 1}, "e1", 0))
+query.add_hyperedge(Hyperedge({1, 2}, "e2", 1))
+query.add_hyperedge(Hyperedge({0, 2}, "e3", 2))
+
+data = Hypergraph()
+data.add_node("a")
+data.add_node("b")
+data.add_node("c")
+data.add_hyperedge(Hyperedge({0, 1}, "e1", 0))
+data.add_hyperedge(Hyperedge({1, 2}, "e2", 1))
+data.add_hyperedge(Hyperedge({0, 2}, "e3", 2))
+
+# register type_same
+
+query_vertices = []
+data_vertices = []
+
+m1= {}
+
+for u in query_vertices:
+    for v in data_vertices:
+        # nli,
+        m1[u, v] = True
+
+query.set_type_same_fn(lambda x_id, y_id: m1[x_id, y_id])
+
+delta = Delta()
+
+likely_vertices = []
+m2 = {}
+
+for (u, v) in likely_vertices:
+    pairs = []
+    for pair in pairs:
+        delta.add_sematic_cluster_pair(u, v, pair[0], pair[1])
+        
+
+
+
+matches = {}
+for (u, v), pair in m2.items():
+    matches[u, v] = [(1, 2)]
+    
+d_match = DMatch.from_dict(matches)
+
+
+
+sim = Hypergraph.get_hyper_simulation(query, data, delta, d_match)
+
+# set[tuple[int, int]]