ocg 0.4.5

100% openCypher-compliant in-memory graph database — 4 backends, 175+ algorithms, pure Rust

OCG — OpenCypher Graph

High-performance in-memory graph database with 100% OpenCypher compliance, 4 backends, and 175+ algorithms — pure Rust.

Overview

OCG executes OpenCypher queries against in-memory property graphs. It is built in pure Rust and exposed to Python via PyO3 bindings.

• 100% OpenCypher TCK: 3,897 / 3,897 scenarios passing (0 skipped, 0 failed)
• 4 graph backends: PropertyGraph, NetworKitRust, RustworkxCore, Graphrs
• 175+ graph algorithms: centrality, community, pathfinding, spanning trees, flow, coloring, matching, cliques, layout, generators
• Bulk Loader API: 57x faster batch construction vs OpenCypher CREATE statements
• Serialization: save/load graphs to JSON with full metadata
• Python 3.11–3.14, macOS · Linux (glibc + musl) · Windows

---

Installation

pip install ocg

Rust:

[dependencies]
ocg = "0.4.1"

---

Quick Start

Python

from ocg import Graph

graph = Graph()

# OpenCypher queries
graph.execute("CREATE (a:Person {name: 'Alice', age: 30})")
graph.execute("CREATE (b:Person {name: 'Bob', age: 25})")
graph.execute("MATCH (a:Person), (b:Person) WHERE a.name='Alice' AND b.name='Bob' CREATE (a)-[:KNOWS]->(b)")

result = graph.execute("MATCH (a:Person)-[:KNOWS]->(b:Person) RETURN a.name AS from, b.name AS to")
print(result)  # [{'from': 'Alice', 'to': 'Bob'}]

Bulk Loader (10–57x faster)

Bypasses the OpenCypher parser for large batch operations:

from ocg import Graph

graph = Graph()

node_ids = graph.bulk_create_nodes([
    (["Person"], {"name": "Alice", "age": 30}),
    (["Person"], {"name": "Bob",   "age": 25}),
])

graph.bulk_create_relationships([
    (node_ids[0], node_ids[1], "KNOWS", {"since": 2020}),
])

result = graph.execute("MATCH (a)-[:KNOWS]->(b) RETURN a.name, b.name")

Serialization

graph.save("my_graph.json")
loaded = Graph.load("my_graph.json")

Rust

use ocg::{PropertyGraph, execute};

let mut graph = PropertyGraph::new();
execute(&mut graph, "CREATE (a:Person {name: 'Alice'})").unwrap();
let result = execute(&mut graph, "MATCH (n:Person) RETURN n.name").unwrap();

---

Graph Backends

Backend	Class	Description
PropertyGraph	Graph	Native petgraph-based property graph
NetworKitRust	NetworKitGraph	Port of NetworKit algorithms to pure Rust
RustworkxCore	RustworkxGraph	IBM Qiskit rustworkx-core algorithms
Graphrs	GraphrsGraph	graphrs-based community detection

All four backends expose identical APIs: OpenCypher execution, bulk loader, 175+ algorithms, and save/load.

---

Graph Algorithms (175+)

All algorithms are available on all 4 backends.

Category	Algorithms
Centrality	degree, betweenness, closeness, pagerank, eigenvector, katz, harmonic, voterank
Pathfinding	bfs, dijkstra, astar, bellman_ford, floyd_warshall, all_pairs, all_simple_paths, all_pairs_all_simple_paths
Shortest Paths	single_source, multi_source, k_shortest, average_shortest_path_length
Spanning Trees	minimum, maximum, steiner_tree
DAG	topological_sort, is_dag, find_cycles, dag_longest_path, transitive_closure, transitive_reduction, dag_to_tree
Flow	max_flow, min_cut_capacity
Coloring	node_coloring, edge_coloring, chromatic_number
Matching	max_weight_matching, max_cardinality_matching
Community	louvain, label_propagation, girvan_newman
Components	connected_components, strongly_connected, number_weakly_connected, is_connected, is_tree, is_forest
Cliques	find_cliques, max_clique, clique_number, node_clique_number, cliques_containing_node
Traversal	dfs, bfs_layers, descendants, ancestors
Transitivity	triangles, transitivity, clustering, average_clustering, square_clustering
Graph Ops	complement, line_graph, cartesian_product, tensor_product, strong_product, lexicographic_product, graph_power
Euler	is_eulerian, eulerian_circuit, semieulerian
Planar	is_planar
Contraction	contract_nodes, quotient_graph
Token Swapper	token_swapper
Generators	erdos_renyi, barabasi_albert, complete_graph, path_graph, cycle_graph, star_graph, grid_graph, petersen_graph, watts_strogatz, configuration_model, expected_degree_graph
Layout	spring, kamada_kawai, spectral, sfdp, hierarchical, bipartite, circular, shell, random

from ocg import Graph

graph = Graph()
# ... populate graph ...

scores = graph.pagerank(damping=0.85, max_iter=100)
communities = graph.louvain()
path = graph.dijkstra(source_id, target_id)

---

Supported OpenCypher Features

Clauses

• MATCH, OPTIONAL MATCH, variable-length paths [*1..3]
• CREATE, MERGE, SET, DELETE, DETACH DELETE, REMOVE
• WITH, UNWIND, RETURN, WHERE
• ORDER BY, SKIP, LIMIT, DISTINCT
• UNION, UNION ALL

Expressions

• Property access, list indexing, string slicing
• Arithmetic: +, -, *, /, %, ^
• Comparison: =, <>, <, >, <=, >=
• Logical: AND, OR, NOT, XOR
• String: STARTS WITH, ENDS WITH, CONTAINS, =~
• Null: IS NULL, IS NOT NULL
• List: IN, comprehensions, quantifiers

Functions (60+)

• String: substring, trim, toLower, toUpper, split, replace
• Math: abs, ceil, floor, round, sqrt, sin, cos, log
• List: size, head, tail, range, reverse, keys
• Aggregation: count, sum, avg, min, max, collect
• Temporal: date, datetime, localDatetime, duration
• Predicates: exists, all, any, none, single

Procedures

• db.labels(), db.relationshipTypes(), db.propertyKeys()
• dbms.components()

---

TCK Compliance

3,897 / 3,897 scenarios passing — 100% (0 skipped, 0 failed)

Validated against the openCypher Technology Compatibility Kit.

---

Development

# Build
cargo build --release

# Unit tests
cargo test --no-default-features

# OpenCypher TCK
cargo test --test tck_property_graph --no-default-features

# Python wheel (requires maturin)
maturin develop --features python

---

Credits

• petgraph — core graph data structures (MIT/Apache-2.0)
• rustworkx-core — graph algorithms (Apache-2.0)
• graphrs — community detection (MIT)
• openCypher TCK — test compatibility kit (Apache-2.0)
• Algorithm designs inspired by NetworKit (MIT)

Algorithm implementations (PageRank, Betweenness Centrality, Dijkstra, etc.) are based on published academic work. See NOTICE file for complete citations.

---

License

Apache-2.0 — see LICENSE and NOTICE files.

OpenCypher® and Cypher® are registered trademarks of Neo4j, Inc. This project implements the open OpenCypher specification and is not affiliated with Neo4j.

---

Contributing

Issues and proposals may be submitted via GitHub. Contributions are evaluated on a controlled schedule — pull requests are reviewed at the maintainer's discretion and timeline.