Skip to main contentModule algorithms
Source - astar
- A* Pathfinding Algorithm for CFG with 3D Spatial Heuristics
- complexity
- Cyclomatic Complexity Calculation from Branch Counts
- dominance
- Dominance and Dominance Frontier Analysis
- four_d
- 4D graph traversal primitives.
- loop_detection
- Loop Detection via Y-Coordinate Clustering
- natural_loops
- Natural Loop Detection using Dominance Information
- scc
- Tarjan’s Strongly Connected Components (SCC) Algorithm
- slicing
- Program Slicing - Backward and Forward Slicing
- topo_sort
- Topological Sort with Cycle Detection
- transitive
- Transitive Closure and Reduction