Block Graph Tools

isax.Node

Graph node with auto-incrementing ID for unique identification.

isax.Edge

Edge connecting 2 or more nodes (supports hyperedges).

__init__(*nodes)

isax.EqxGraph

Stores node-to-index mappings for efficient array operations.

The dictionaries restrict batching over different graph topologies.

isax.BlockGraph

General block graph structure for efficient block-wise operations.

A graph G = (V, E) where vertices are organized into blocks for parallelized computation.

__init__(blocks: list, edges: list)

get_edge_structure() -> tuple

Convert edge list to padded array representation.

get_sampling_params() -> tuple

Generate all parameters needed for graph sampling.