Struct Graph 

pub struct Graph {
    pub adj: HashMap<Point, Vec<Edge>>,
    pub source: Point,
    pub sink: Point,
}

Represents the entire flow network, including all nodes and edges.

Fields

adj: HashMap<Point, Vec<Edge>>

source: Point

sink: Point

Implementations

impl Graph

pub fn new(source: Point, sink: Point) -> Self

Creates a new, empty graph with a defined source and sink.

pub fn add_node(&mut self, node: Point)

Adds a new node to the graph. Ensures a node exists in the adjacency list, even if it has no outgoing edges.

pub fn add_edge(&mut self, from: Point, to: Point, capacity: u64, cost: f64)

Adds a directed edge to the graph. This will be the primary way we build our network from the maze or automaton state.

pub fn get_edges(&self, node: &Point) -> &Vec<Edge>

A helper to get all outgoing edges from a given node.

pub fn edmonds_karp(&mut self) -> u64

Calculates the maximum flow, now using a cost-aware pathfinding method.

pub fn route_cheapest_path(&mut self) -> (u64, Option<Vec<Point>>)

Finds the single cheapest path and routes flow down it. This replaces edmonds_karp to act as a policy-driven Tactician. Finds the single cheapest path and routes flow, returning the flow and the path itself.

Trait Implementations

impl Debug for Graph

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

Formats the value using the given formatter.