Struct bevy_internal::utils::petgraph::matrix_graph::MatrixGraph

pub struct MatrixGraph<N, E, Ty = Directed, Null = Option<E>, Ix = u16>
where
    Null: Nullable<Wrapped = E>,
{ /* private fields */ }

MatrixGraph<N, E, Ty, Null> is a graph datastructure using an adjacency matrix representation.

MatrixGraph is parameterized over:

• Associated data N for nodes and E for edges, called weights. The associated data can be of arbitrary type.
• Edge type Ty that determines whether the graph edges are directed or undirected.
• Nullable type Null, which denotes the edges’ presence (defaults to Option<E>). You may specify NotZero<E> if you want to use a sentinel value (such as 0) to mark the absence of an edge.
• Index type Ix that sets the maximum size for the graph (defaults to DefaultIx).

The graph uses O(|V^2|) space, with fast edge insertion & amortized node insertion, as well as efficient graph search and graph algorithms on dense graphs.

This graph is backed by a flattened 2D array. For undirected graphs, only the lower triangular matrix is stored. Since the backing array stores edge weights, it is recommended to box large edge weights.

Implementations

impl<N, E, Ty, Null, Ix> MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

pub fn with_capacity(node_capacity: usize) -> MatrixGraph<N, E, Ty, Null, Ix>

Create a new MatrixGraph with estimated capacity for nodes.

pub fn clear(&mut self)

Remove all nodes and edges.

pub fn node_count(&self) -> usize

Return the number of nodes (vertices) in the graph.

Computes in O(1) time.

pub fn edge_count(&self) -> usize

Return the number of edges in the graph.

Computes in O(1) time.

pub fn is_directed(&self) -> bool

Return whether the graph has directed edges or not.

pub fn add_node(&mut self, weight: N) -> NodeIndex<Ix>

Add a node (also called vertex) with associated data weight to the graph.

Computes in O(1) time.

Return the index of the new node.

Panics if the MatrixGraph is at the maximum number of nodes for its index type.

pub fn remove_node(&mut self, a: NodeIndex<Ix>) -> N

Remove a from the graph.

Computes in O(V) time, due to the removal of edges with other nodes.

Panics if the node a does not exist.

pub fn update_edge( &mut self, a: NodeIndex<Ix>, b: NodeIndex<Ix>, weight: E ) -> Option<E>

Update the edge from a to b to the graph, with its associated data weight.

Return the previous data, if any.

Computes in O(1) time, best case. Computes in O(|V|^2) time, worst case (matrix needs to be re-allocated).

Panics if any of the nodes don’t exist.

pub fn add_edge(&mut self, a: NodeIndex<Ix>, b: NodeIndex<Ix>, weight: E)

Add an edge from a to b to the graph, with its associated data weight.

Computes in O(1) time, best case. Computes in O(|V|^2) time, worst case (matrix needs to be re-allocated).

Panics if any of the nodes don’t exist. Panics if an edge already exists from a to b.

Note: MatrixGraph does not allow adding parallel (“duplicate”) edges. If you want to avoid this, use .update_edge(a, b, weight) instead.

pub fn remove_edge(&mut self, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> E

Remove the edge from a to b to the graph.

Panics if any of the nodes don’t exist. Panics if no edge exists between a and b.

pub fn has_edge(&self, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool

Return true if there is an edge between a and b.

Panics if any of the nodes don’t exist.

pub fn node_weight(&self, a: NodeIndex<Ix>) -> &N

Access the weight for node a.

Also available with indexing syntax: &graph[a].

Panics if the node doesn’t exist.

pub fn node_weight_mut(&mut self, a: NodeIndex<Ix>) -> &mut N

Access the weight for node a, mutably.

Also available with indexing syntax: &mut graph[a].

Panics if the node doesn’t exist.

pub fn edge_weight(&self, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> &E

Access the weight for edge e.

Also available with indexing syntax: &graph[e].

Panics if no edge exists between a and b.

pub fn edge_weight_mut(&mut self, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> &mut E

Access the weight for edge e, mutably.

Also available with indexing syntax: &mut graph[e].

Panics if no edge exists between a and b.

pub fn neighbors(&self, a: NodeIndex<Ix>) -> Neighbors<'_, Ty, Null, Ix>

Return an iterator of all nodes with an edge starting from a.

• Directed: Outgoing edges from a.
• Undirected: All edges from or to a.

Produces an empty iterator if the node doesn’t exist.
Iterator element type is NodeIndex<Ix>.

pub fn edges(&self, a: NodeIndex<Ix>) -> Edges<'_, Ty, Null, Ix>

Return an iterator of all edges of a.

• Directed: Outgoing edges from a.
• Undirected: All edges connected to a.

Produces an empty iterator if the node doesn’t exist.
Iterator element type is (NodeIndex<Ix>, NodeIndex<Ix>, &E).

pub fn from_edges<I>(iterable: I) -> MatrixGraph<N, E, Ty, Null, Ix>

where I: IntoIterator, <I as IntoIterator>::Item: IntoWeightedEdge<E>, <<I as IntoIterator>::Item as IntoWeightedEdge<E>>::NodeId: Into<NodeIndex<Ix>>, N: Default,

Create a new MatrixGraph from an iterable of edges.

Node weights N are set to default values. Edge weights E may either be specified in the list, or they are filled with default values.

Nodes are inserted automatically to match the edges.

use petgraph::matrix_graph::MatrixGraph;

let gr = MatrixGraph::<(), i32>::from_edges(&[
    (0, 1), (0, 2), (0, 3),
    (1, 2), (1, 3),
    (2, 3),
]);

pub fn extend_with_edges<I>(&mut self, iterable: I)

where I: IntoIterator, <I as IntoIterator>::Item: IntoWeightedEdge<E>, <<I as IntoIterator>::Item as IntoWeightedEdge<E>>::NodeId: Into<NodeIndex<Ix>>, N: Default,

Extend the graph from an iterable of edges.

Node weights N are set to default values. Edge weights E may either be specified in the list, or they are filled with default values.

Nodes are inserted automatically to match the edges.

impl<N, E, Null, Ix> MatrixGraph<N, E, Directed, Null, Ix>

where Null: Nullable<Wrapped = E>, Ix: IndexType,

pub fn neighbors_directed( &self, a: NodeIndex<Ix>, d: Direction ) -> Neighbors<'_, Directed, Null, Ix>

Return an iterator of all neighbors that have an edge between them and a, in the specified direction. If the graph’s edges are undirected, this is equivalent to .neighbors(a).

• Outgoing: All edges from a.
• Incoming: All edges to a.

Produces an empty iterator if the node doesn’t exist.
Iterator element type is NodeIndex<Ix>.

pub fn edges_directed( &self, a: NodeIndex<Ix>, d: Direction ) -> Edges<'_, Directed, Null, Ix>

Return an iterator of all edges of a, in the specified direction.

• Outgoing: All edges from a.
• Incoming: All edges to a.

Produces an empty iterator if the node a doesn’t exist.
Iterator element type is (NodeIndex<Ix>, NodeIndex<Ix>, &E).

impl<N, E> MatrixGraph<N, E>

pub fn new() -> MatrixGraph<N, E>

Create a new MatrixGraph with directed edges.

This is a convenience method. Use MatrixGraph::with_capacity or MatrixGraph::default for a constructor that is generic in all the type parameters of MatrixGraph.

impl<N, E> MatrixGraph<N, E, Undirected>

pub fn new_undirected() -> MatrixGraph<N, E, Undirected>

Create a new MatrixGraph with undirected edges.

This is a convenience method. Use MatrixGraph::with_capacity or MatrixGraph::default for a constructor that is generic in all the type parameters of MatrixGraph.

Trait Implementations

impl<N, E, Ty, Null, Ix> Build for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

fn add_node( &mut self, weight: <MatrixGraph<N, E, Ty, Null, Ix> as Data>::NodeWeight ) -> <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId

fn add_edge( &mut self, a: <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId, b: <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId, weight: <MatrixGraph<N, E, Ty, Null, Ix> as Data>::EdgeWeight ) -> Option<<MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::EdgeId>

Add a new edge. If parallel edges (duplicate) are not allowed and the edge already exists, return None.

fn update_edge( &mut self, a: <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId, b: <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId, weight: <MatrixGraph<N, E, Ty, Null, Ix> as Data>::EdgeWeight ) -> <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::EdgeId

Add or update the edge from a to b. Return the id of the affected edge.

impl<N, E, Ty, Null, Ix> Clone for MatrixGraph<N, E, Ty, Null, Ix>

where N: Clone, E: Clone, Ty: Clone, Null: Clone + Nullable<Wrapped = E>, Ix: Clone,

fn clone(&self) -> MatrixGraph<N, E, Ty, Null, Ix>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N, E, Ty, Null, Ix> Data for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type NodeWeight = N

type EdgeWeight = E

impl<N, E, Ty, Null, Ix> Default for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

Create a new empty MatrixGraph.

fn default() -> MatrixGraph<N, E, Ty, Null, Ix>

Returns the “default value” for a type.

impl<N, E, Ty, Null, Ix> EdgeCount for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

fn edge_count(&self) -> usize

Return the number of edges in the graph.

impl<N, E, Ty, Null, Ix> GetAdjacencyMatrix for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type AdjMatrix = ()

The associated adjacency matrix type

fn adjacency_matrix( &self ) -> <MatrixGraph<N, E, Ty, Null, Ix> as GetAdjacencyMatrix>::AdjMatrix

Create the adjacency matrix

fn is_adjacent( &self, _: &<MatrixGraph<N, E, Ty, Null, Ix> as GetAdjacencyMatrix>::AdjMatrix, a: NodeIndex<Ix>, b: NodeIndex<Ix> ) -> bool

Return true if there is an edge from a to b, false otherwise.

impl<N, E, Ty, Null, Ix> GraphBase for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type NodeId = NodeIndex<Ix>

node identifier

type EdgeId = (NodeIndex<Ix>, NodeIndex<Ix>)

edge identifier

impl<N, E, Ty, Null, Ix> GraphProp for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type EdgeType = Ty

The kind of edges in the graph.

fn is_directed(&self) -> bool

impl<N, E, Ty, Null, Ix> Index<(NodeIndex<Ix>, NodeIndex<Ix>)> for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

Index the MatrixGraph by NodeIndex pair to access edge weights.

Also available with indexing syntax: &graph[e].

Panics if no edge exists between a and b.

type Output = E

The returned type after indexing.

fn index(&self, _: (NodeIndex<Ix>, NodeIndex<Ix>)) -> &E

Performs the indexing (container[index]) operation.

impl<N, E, Ty, Null, Ix> Index<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

Index the MatrixGraph by NodeIndex to access node weights.

Panics if the node doesn’t exist.

type Output = N

The returned type after indexing.

fn index(&self, ax: NodeIndex<Ix>) -> &N

Performs the indexing (container[index]) operation.

impl<N, E, Ty, Null, Ix> IndexMut<(NodeIndex<Ix>, NodeIndex<Ix>)> for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

Index the MatrixGraph by NodeIndex pair to access edge weights.

Also available with indexing syntax: &mut graph[e].

Panics if no edge exists between a and b.

fn index_mut(&mut self, _: (NodeIndex<Ix>, NodeIndex<Ix>)) -> &mut E

Performs the mutable indexing (container[index]) operation.

impl<N, E, Ty, Null, Ix> IndexMut<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

Index the MatrixGraph by NodeIndex to access node weights.

Panics if the node doesn’t exist.

fn index_mut(&mut self, ax: NodeIndex<Ix>) -> &mut N

Performs the mutable indexing (container[index]) operation.

impl<'a, N, E, Ty, Null, Ix> IntoEdgeReferences for &'a MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type EdgeRef = (NodeIndex<Ix>, NodeIndex<Ix>, &'a E)

type EdgeReferences = EdgeReferences<'a, Ty, Null, Ix>

fn edge_references( self ) -> <&'a MatrixGraph<N, E, Ty, Null, Ix> as IntoEdgeReferences>::EdgeReferences

impl<'a, N, E, Ty, Null, Ix> IntoEdges for &'a MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type Edges = Edges<'a, Ty, Null, Ix>

fn edges( self, a: <&'a MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId ) -> <&'a MatrixGraph<N, E, Ty, Null, Ix> as IntoEdges>::Edges

impl<'a, N, E, Null, Ix> IntoEdgesDirected for &'a MatrixGraph<N, E, Directed, Null, Ix>

where Null: Nullable<Wrapped = E>, Ix: IndexType,

type EdgesDirected = Edges<'a, Directed, Null, Ix>

fn edges_directed( self, a: <&'a MatrixGraph<N, E, Directed, Null, Ix> as GraphBase>::NodeId, dir: Direction ) -> <&'a MatrixGraph<N, E, Directed, Null, Ix> as IntoEdgesDirected>::EdgesDirected

impl<'a, N, E, Ty, Null, Ix> IntoNeighbors for &'a MatrixGraph<N, E, Ty, Null, Ix>

where E: 'a, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type Neighbors = Neighbors<'a, Ty, Null, Ix>

fn neighbors( self, a: NodeIndex<Ix> ) -> <&'a MatrixGraph<N, E, Ty, Null, Ix> as IntoNeighbors>::Neighbors

Return an iterator of the neighbors of node a.

impl<'a, N, E, Null, Ix> IntoNeighborsDirected for &'a MatrixGraph<N, E, Directed, Null, Ix>

where E: 'a, Null: Nullable<Wrapped = E>, Ix: IndexType,

type NeighborsDirected = Neighbors<'a, Directed, Null, Ix>

fn neighbors_directed( self, a: NodeIndex<Ix>, d: Direction ) -> <&'a MatrixGraph<N, E, Directed, Null, Ix> as IntoNeighborsDirected>::NeighborsDirected

impl<'a, N, E, Ty, Null, Ix> IntoNodeIdentifiers for &'a MatrixGraph<N, E, Ty, Null, Ix>

where E: 'a, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type NodeIdentifiers = NodeIdentifiers<'a, Ix>

fn node_identifiers( self ) -> <&'a MatrixGraph<N, E, Ty, Null, Ix> as IntoNodeIdentifiers>::NodeIdentifiers

impl<'a, N, E, Ty, Null, Ix> IntoNodeReferences for &'a MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type NodeRef = (NodeIndex<Ix>, &'a N)

type NodeReferences = NodeReferences<'a, N, Ix>

fn node_references( self ) -> <&'a MatrixGraph<N, E, Ty, Null, Ix> as IntoNodeReferences>::NodeReferences

impl<N, E, Ty, Null, Ix> NodeCount for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

fn node_count(&self) -> usize

impl<N, E, Ty, Null, Ix> NodeIndexable for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

fn node_bound(&self) -> usize

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap).

fn to_index(&self, ix: NodeIndex<Ix>) -> usize

Convert a to an integer index.

fn from_index( &self, ix: usize ) -> <MatrixGraph<N, E, Ty, Null, Ix> as GraphBase>::NodeId

Convert i to a node index. i must be a valid value in the graph.

impl<N, E, Ty, Null, Ix> Visitable for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

type Map = FixedBitSet

The associated map type

fn visit_map(&self) -> FixedBitSet

Create a new visitor map

fn reset_map( &self, map: &mut <MatrixGraph<N, E, Ty, Null, Ix> as Visitable>::Map )

Reset the visitor map (and resize to new size of graph if needed)