Repository navigation
Deterministic Graph Algorithms
Category: Deterministic Computing · Kind: Runtime
Reachability, breadth/depth-first traversal, cycle detection, topological order and component analysis use explicit scratch/output storage.
Common use: Analyze deterministic simulation graphs.
Includes: TryReachable, TryBreadthFirst, TryDepthFirst, TryHasCycle, TryTopologicalOrder, TryComponents.
Related: Deterministic Graphs · Frozen Deterministic Graphs.
Source: Core/DataStructure/Deterministic/Collections/GraphAlgorithms.cs (local snapshot; published module).
Category · Full catalog · Common combinations
Documentation snapshot: 2026-10-11
Search aliases: TryReachable, TryBreadthFirst, TryDepthFirst, TryHasCycle, TryTopologicalOrder, TryComponents
Tags: legendarytools/feature, legendarytools/deterministic-computing
- Architecture and State
- Asset and Content Editors
- Assets and Identity
- Async and Startup
- Audio
- Binding and Scripting
- Code and Automation Editors
- Collections and Algorithms
- Deterministic Computing
- Developer Tooling
- Editor Interface and Diagnostics
- Gameplay and Attributes
- Math and Extensions
- Persistence and Time
- ScriptableObject Architecture
- Spatial and Geometry
- UI and Navigation
- Unity Runtime Helpers