Struct PlacementGraph 

pub struct PlacementGraph {
    pub nodes: Vec<PlacementGraphNode>,
    pub edges: Vec<PlacementGraphEdge>,
}

Fields

nodes: Vec<PlacementGraphNode>

Nodes are topologically ordered. Edges must point from a lower index to a higher index.

edges: Vec<PlacementGraphEdge>

Trait Implementations

impl Clone for PlacementGraph

fn clone(&self) -> PlacementGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PlacementGraph

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

Formats the value using the given formatter.

impl Default for PlacementGraph

fn default() -> PlacementGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for PlacementGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for PlacementGraph

impl PartialEq for PlacementGraph

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for PlacementGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for PlacementGraph