Struct TopologyGraph 

pub struct TopologyGraph { /* private fields */ }

Lazy-rebuilt connectivity graph for topology queries.

Tracks which stops are reachable from which, via which groups/lines. Rebuilt from ElevatorGroup data when marked dirty.

Implementations

impl TopologyGraph

pub fn new() -> Self

Create a new topology graph (starts dirty so the first query triggers a rebuild).

pub const fn mark_dirty(&mut self)

Mark the graph as needing rebuild.

pub const fn is_dirty(&self) -> bool

Whether the graph needs rebuild.

pub fn rebuild(&mut self, groups: &[ElevatorGroup])

Rebuild the graph from current group/line topology.

pub fn reachable_stops_from(&self, stop: EntityId) -> Vec<EntityId>

All stops reachable from a given stop (BFS).

Returns every reachable stop except the origin. If the origin has no outgoing edges the result is empty.

pub fn transfer_points(groups: &[ElevatorGroup]) -> Vec<EntityId>

Stops that appear in two or more groups (transfer points).

This inspects group membership directly and does not require the adjacency graph.

pub fn shortest_route(&self, from: EntityId, to: EntityId) -> Option<Route>

Find the shortest route from one stop to another (BFS on groups).

Returns None if to is unreachable from from, or if from == to. Each edge traversal becomes one RouteLeg; consecutive stops sharing the same group naturally coalesce into a single leg when the caller chooses to, but the raw path is returned as individual per-hop legs so the consumer can decide on merging strategy.

Trait Implementations

impl Debug for TopologyGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TopologyGraph

fn default() -> Self

Returns the “default value” for a type.