Expand description
Network topology graph representation
Builds a petgraph DiGraph from netelements and netrelations to enable efficient path traversal, navigability checking, and shortest-path routing.
Structs§
- Netelement
Side - Represents one end of a netelement in the topology graph
Functions§
- build_
topology_ graph - Build a directed graph representing the railway network topology
- cached_
shortest_ path_ distance - Look up or compute the shortest-path distance between two netelement sides, caching the result for future queries.
- shortest_
path_ distance - Compute the shortest-path distance between two netelement sides.
- shortest_
path_ route - Return the sequence of graph nodes along the shortest direction-aware path.
- validate_
netrelation_ references - Validate that all netrelations reference existing netelements
Type Aliases§
- Shortest
Path Cache - Cache for shortest-path queries between netelement sides.