Struct Graph 

pub struct Graph<E> { /* private fields */ }

Generic graph structure that can hold any edge type E

Stores edges as an edge list for efficient serialization. Provides adjacency list views for graph algorithms.

Implementations

impl<E> Graph<E>

pub fn new() -> Self

Create a new empty graph

pub fn add_edge(&mut self, edge: Edge<E>) -> KanbanResult<()>

Add an edge to the graph

Note: Cycle checking must be done by caller if needed (see would_create_cycle method)

pub fn remove_edge(&mut self, source: Uuid, target: Uuid) -> bool

where E: Clone,

Remove an edge between two nodes

Returns true if an edge was removed, false if no matching edge found

pub fn remove_node(&mut self, node_id: Uuid)

Remove all edges involving a node (for deletion cascades)

pub fn archive_node(&mut self, node_id: Uuid)

Archive all edges involving a node (for archive cascades)

pub fn unarchive_node(&mut self, node_id: Uuid)

Unarchive all edges involving a node (for unarchive cascades)

pub fn outgoing(&self, node_id: Uuid) -> Vec<&Edge<E>>

Get all outgoing edges from a node (where node is source)

pub fn incoming(&self, node_id: Uuid) -> Vec<&Edge<E>>

Get all incoming edges to a node (where node is target)

pub fn outgoing_active(&self, node_id: Uuid) -> Vec<&Edge<E>>

Get all active outgoing edges from a node

pub fn incoming_active(&self, node_id: Uuid) -> Vec<&Edge<E>>

Get all active incoming edges to a node

pub fn neighbors(&self, node_id: Uuid) -> Vec<Uuid>

where E: Clone,

Get all neighbor node IDs (connected nodes, handling bidirectional edges)

pub fn neighbors_active(&self, node_id: Uuid) -> Vec<Uuid>

where E: Clone,

Get all active neighbor node IDs

pub fn adjacency_list(&self) -> HashMap<Uuid, Vec<Uuid>>

where E: Clone,

Build an adjacency list view of the graph (for algorithms) Only includes active edges

pub fn edges(&self) -> &[Edge<E>]

Get all edges (for serialization/inspection)

pub fn active_edges(&self) -> Vec<&Edge<E>>

Get all active edges

pub fn has_edge(&self, source: Uuid, target: Uuid) -> bool

where E: Clone,

Check if an edge exists between two nodes

pub fn would_create_cycle(&self, source: Uuid, target: Uuid) -> bool

where E: Clone,

Check if adding an edge would create a cycle Only checks active edges

pub fn has_cycle(&self) -> bool

where E: Clone,

Check if the graph contains any cycles Only checks active edges

pub fn reachable_from(&self, start: Uuid) -> HashSet<Uuid>

where E: Clone,

Get all nodes reachable from a given node Only considers active edges

pub fn edge_count(&self) -> usize

Get the count of edges (total, including archived)

pub fn active_edge_count(&self) -> usize

Get the count of active edges

Trait Implementations

impl<E: Clone> Clone for Graph<E>

fn clone(&self) -> Graph<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Debug> Debug for Graph<E>

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

Formats the value using the given formatter.

impl<E> Default for Graph<E>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, E> Deserialize<'de> for Graph<E>

where E: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<E> Serialize for Graph<E>

where E: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.