Merge pull request #253 from marvin-hansen/main

Removed GH action to run benches; updated version numbers.

Author: marvin-hansen

.github/workflows/run_benches.yml

@@ -7,6 +7,19 @@ members = [
     "deep_causality_macros",
 ]
 
+[workspace.dependencies]
+# ==============
+# Internal Dependencies Aliases
+# ==============
+dcl_data_structures = {path = "dcl_data_structures"}
+deep_causality_macros = {path = "deep_causality_macros"}
+ultragraph = {path = "ultragraph"}
+# ==============
+# External Dependencies Aliases
+# ==============
+proc-macro2 = "1.0.95"
+quote = "1.0"
+syn = "2.0"
 
 # Optimize all crates
 [profile.release]

Cargo.lock

@@ -17,21 +17,10 @@ exclude = ["*.bazel", "*/*.bazel",  "*.bazel.*", "BUILD", "BUILD.bazel", "MODULE
 
 
 [dependencies]
-
-
-[dependencies.dcl_data_structures]
-path = "../dcl_data_structures"
-version = "0.9"
-
-
-[dependencies.deep_causality_macros]
-path = "../deep_causality_macros"
-version = "0.4"
-
-
-[dependencies.ultragraph]
-path = "../ultragraph"
-version = "0.5"
+# Internal Dependencies
+dcl_data_structures = {workspace = true}
+deep_causality_macros = {workspace = true}
+ultragraph = {workspace = true}
 
 
 [dev-dependencies]

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "deep_causality_macros"
-version = "0.4.11"
+version = "0.7.5"
 edition = "2021"
 rust-version = "1.80"
 repository = "https://github.com/deepcausality/deep_causality.rs"
@@ -16,9 +16,9 @@ proc-macro = true
 [features]
 
 [dependencies]
-proc-macro2 = "1.0.95"
-quote = "1.0"
-syn = "2.0"
+proc-macro2 = {workspace = true}
+quote = {workspace = true}
+syn = {workspace = true}
 
 [package.metadata.docs.rs]
 all-features = true

deep_causality/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "ultragraph"
-version = "0.5.6"
+version = "0.7.5"
 edition = "2021"
 rust-version = "1.80"
 repository = "https://github.com/deepcausality/deep_causality.rs"
@@ -13,12 +13,10 @@ categories = ["data-structures"]
 keywords = ["data-structures"]
 exclude = ["*.bazel", "*/*.bazel",  "*.bazel.*", "BUILD", "BUILD.bazel", "MODULE.bazel", ".bazelignore",".bazelrc", "tests/**/*"]
 
-[dependencies.deep_causality_macros]
-path = "../deep_causality_macros"
-version = "^0.4"
-
 
 [dependencies]
+# Internal Dependencies
+deep_causality_macros = {workspace = true}
 
 [dev-dependencies]
 criterion = { version = "0.6", features = ["html_reports"] }

deep_causality_macros/Cargo.toml

@@ -23,7 +23,7 @@
 
 ## 📣 Goal
 
-`ultragraph` provides a high-performance, ergonomic, and directed graph data structure. It is designed around a
+ultragraph provides a high-performance, ergonomic, and directed graph data structure. It is designed around a
 state-machine architecture that offers both a flexible, mutable graph and a blazing-fast, immutable graph, allowing
 users to choose the right tool for the right phase of their application.
 
@@ -94,17 +94,17 @@ calculation based on the mean time.)*
 
 ## Performance Design
 
-The design of `next_graph`'s static analysis structure, `CsmGraph`, is based on the principles for high-performance
+The design of `ultragraph`'s static analysis structure, `CsmGraph`, is based on the principles for high-performance
 sparse graph representation detailed in the paper "NWHy: A Framework for Hypergraph Analytics" (Liu et al.).
-Specifically, `next_graph` adopts the paper's foundational model of using two mutually-indexed Compressed Sparse Row (
+Specifically, `ultragraph` adopts the paper's foundational model of using two mutually-indexed Compressed Sparse Row (
 CSR) structures to enable efficient, `O(degree)` bidirectional traversal—one for forward (outbound) edges and one for
 the transposed graph for backward (inbound) edges.
 
-However, `next_graph` introduces three significant architectural enhancements over this baseline to provide optimal
+However, `ultragraph` introduces three significant architectural enhancements over this baseline to provide optimal
 performance and to support the specific requirements of dynamically evolving systems.
 
 1. **Struct of Arrays (SoA) Memory Layout:** The internal CSR adjacency structures are implemented using a Struct of
-   Arrays layout. Instead of a single `Vec<(target, weight)>`, `next_graph` uses two parallel vectors: `Vec<target>` and
+   Arrays layout. Instead of a single `Vec<(target, weight)>`, `ultragraph` uses two parallel vectors: `Vec<target>` and
    `Vec<weight>`. This memory layout improves data locality for topology-only algorithms (e.g., reachability, cycle
    detection). By iterating exclusively over the `targets` vector, these algorithms avoid loading unused edge weight
    data into the CPU cache, which minimizes memory bandwidth usage and reduces cache pollution.
@@ -116,7 +116,7 @@ performance and to support the specific requirements of dynamically evolving sys
    performance across varied graph structures.
 
 3. **Formal Evolutionary Lifecycle:** The most significant architectural addition is a formal two-state model for graph
-   evolution. `next_graph` defines two distinct representations: a mutable `DynamicGraph` optimized for efficient `O(1)`
+   evolution. `ultragraph` defines two distinct representations: a mutable `DynamicGraph` optimized for efficient `O(1)`
    node and edge additions, and the immutable `CsmGraph` optimized for analysis. The library provides high-performance
    `O(V + E)` `.freeze()` and `.unfreeze()` operations to transition between these states. This two-state model directly
    supports systems that require dynamic structural evolution, such as those modeling emergent causality, by providing a