Struct Graph 

pub struct Graph<N, E> {
    pub kind: GraphKind,
    /* private fields */
}

Fields

kind: GraphKind

Implementations

impl<N, E> Graph<N, E>

pub fn new(kind: GraphKind) -> Self

pub fn add_node(&mut self, data: N) -> NodeId

pub fn add_node_with_pos(&mut self, data: N, position: Vec2) -> NodeId

pub fn add_edge(&mut self, from: NodeId, to: NodeId, data: E) -> EdgeId

pub fn add_edge_weighted( &mut self, from: NodeId, to: NodeId, data: E, weight: f32, ) -> EdgeId

pub fn remove_node(&mut self, id: NodeId)

pub fn remove_edge(&mut self, id: EdgeId)

pub fn neighbors(&self, id: NodeId) -> Vec<NodeId>

pub fn neighbor_edges(&self, id: NodeId) -> Vec<(NodeId, EdgeId)>

pub fn degree(&self, id: NodeId) -> usize

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn has_node(&self, id: NodeId) -> bool

pub fn has_edge(&self, id: EdgeId) -> bool

pub fn get_node(&self, id: NodeId) -> Option<&NodeData<N>>

pub fn get_node_mut(&mut self, id: NodeId) -> Option<&mut NodeData<N>>

pub fn get_edge(&self, id: EdgeId) -> Option<&EdgeData<E>>

pub fn get_edge_mut(&mut self, id: EdgeId) -> Option<&mut EdgeData<E>>

pub fn find_edge(&self, from: NodeId, to: NodeId) -> Option<EdgeId>

pub fn edge_weight(&self, id: EdgeId) -> f32

pub fn set_node_position(&mut self, id: NodeId, pos: Vec2)

pub fn node_position(&self, id: NodeId) -> Vec2

pub fn nodes(&self) -> impl Iterator<Item = &NodeData<N>>

pub fn node_ids(&self) -> Vec<NodeId>

pub fn edges(&self) -> impl Iterator<Item = &EdgeData<E>>

pub fn edge_ids(&self) -> Vec<EdgeId>

pub fn bfs(&self, start: NodeId) -> BfsIterator<'_, N, E>

pub fn dfs(&self, start: NodeId) -> DfsIterator<'_, N, E>

pub fn subgraph(&self, node_ids: &[NodeId]) -> Graph<N, E>

where N: Clone, E: Clone,

Extract a subgraph containing only the given node IDs

pub fn union(&self, other: &Graph<N, E>) -> Graph<N, E>

where N: Clone, E: Clone,

Union of two graphs (combines all nodes and edges)

pub fn complement(&self) -> Graph<N, E>

where N: Clone, E: Default + Clone,

Complement graph: has edges where original doesn’t, and vice versa

impl<N: Clone, E: Clone> Graph<N, E>

pub fn to_adjacency_matrix(&self) -> AdjacencyMatrix

pub fn to_edge_list(&self) -> EdgeList

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.