Struct WaitForGraph 

pub struct WaitForGraph { /* private fields */ }

Wait-For Graph for deadlock detection

Maintains a graph where:

• Nodes represent robots
• Edges represent “waits-for” relationships

A cycle in this graph indicates a deadlock.

Implementations

impl WaitForGraph

pub fn new() -> Self

Create a new empty wait-for graph

pub fn add_wait(&mut self, robot: RobotId, waiting_for: WaitingFor)

Record that a robot is waiting for a resource

pub fn remove_wait(&mut self, robot: RobotId)

Remove a robot’s wait (e.g., when it acquires the resource)

pub fn is_waiting(&self, robot: RobotId) -> bool

Check if a robot is currently waiting

pub fn get_wait(&self, robot: RobotId) -> Option<&WaitingFor>

Get what a robot is waiting for, if anything

pub fn waiting_count(&self) -> usize

Get the number of robots currently waiting

pub fn detect_cycle(&self) -> Option<Vec<RobotId>>

Detect if there’s a cycle (deadlock) in the wait-for graph

Returns Some(cycle) with the robot IDs forming the cycle, or None if no deadlock exists.

Uses DFS-based cycle detection.

pub fn detect_all_cycles(&self) -> Vec<Vec<RobotId>>

Detect all cycles in the graph (for debugging/analysis)

pub fn clear(&mut self)

Clear all waits (e.g., at end of simulation)

Trait Implementations

impl Clone for WaitForGraph

fn clone(&self) -> WaitForGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for WaitForGraph

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

Formats the value using the given formatter.

impl Default for WaitForGraph

fn default() -> WaitForGraph

Returns the “default value” for a type.