Skip to main content

Module simple_graph

uni_common::graph

Module simple_graph 

Source
Expand description

Simple adjacency list graph for L0Buffer.

This replaces gryf’s DeltaGraph with a minimal implementation that provides:

  • O(1) vertex lookup
  • O(1) edge lookup by Eid
  • O(degree) neighbor iteration
  • Safe edge deletion without panics

Structs§

EdgeEntry
Edge entry stored in adjacency lists.
SimpleGraph
Simple directed graph with adjacency lists.

Enums§

Direction
Direction for neighbor traversal.