Module pathfinding 

Path Finding Algorithms for RedDB

Shortest path and graph traversal algorithms optimized for attack path analysis:

• BFS: Unweighted shortest paths
• DFS: Deep exploration with backtracking
• Dijkstra: Weighted shortest paths (non-negative weights)
• A*: Heuristic-guided shortest paths
• Bellman-Ford: Handles negative weights
• All Shortest Paths: Find all minimum-length paths
• K-Shortest Paths: Find k best paths (Yen’s algorithm)

Security Use Cases

• Attack Path Analysis: Find shortest exploitation paths
• Lateral Movement: Discover movement paths between hosts
• Privilege Escalation: Map paths to high-value targets
• Risk Assessment: Weight paths by exploit difficulty

Structs

AStar

A* Algorithm for heuristic-guided shortest paths

AllPathsResult

Result of all shortest paths query

AllShortestPaths

Find all shortest paths (same minimum length) between two nodes

BFS

Breadth-First Search for unweighted shortest paths

BellmanFord

Bellman-Ford Algorithm for graphs with negative weights

BellmanFordResult

Result of Bellman-Ford algorithm

DFS

Depth-First Search for deep graph exploration

Dijkstra

Dijkstra’s Algorithm for weighted shortest paths

KShortestPaths

K-Shortest Paths using Yen’s Algorithm

Path

A path through the graph

ShortestPathResult

Result of a shortest path query