Struct Graph

pub struct Graph {
    vertices: FxHashMap<VertexId, FxHashSet<ConstraintId>>,
    constraints: FxHashMap<ConstraintId, FxHashSet<VertexId>>,
}

Bipartite graph between XPBD constraints and mesh vertices

Fields

vertices: FxHashMap<VertexId, FxHashSet<ConstraintId>>

constraints: FxHashMap<ConstraintId, FxHashSet<VertexId>>

Implementations

impl Graph

pub fn new(constraints: &[Constraint]) -> Pin<Box<Self>>

pub fn constraints_disj(&self, priorities: &[isize]) -> Vec<Vec<ConstraintId>>

Given a graph & a slice mapping constraint index to the constraint’s priority, divides the constraints into a vec of vecs of constraints, where the inner vecs’ constraints are guaranteed to be the same priority and share no vertices.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Graph

impl StructuralPartialEq for Graph