Expand description
A semantically-typed, directed graph optimized for modification and traversal.
This graph uses an adjacency list representation (HashMap<NodeId, Vec<FractalGraphEdge>>)
for efficient access to a node’s outgoing edges. It is designed to be the
foundational structure for complex simulations.
Structs§
- Fractal
Graph - A directed graph using an adjacency list for its structure.
The generic type
Trepresents the data stored in each node’s payload. - Fractal
Graph Edge - Represents a directed connection between two nodes. This is the core data-carrying element for your simulation.
- Node
- A generic container for the data stored within each node.
The
Tcan be whatever you need for your simulation. - NodeId
- A unique identifier for a node in the graph. Using a struct wrapper provides type safety over a raw u64.
Enums§
- Edge
Type - Semantic classification of an edge.
- Graph
Error