Struct Layout 

pub struct Layout {
    pub positions: HashMap<NodeId, Pos>,
    pub paths: HashMap<EdgeId, Vec<Pos>>,
    pub score: f32,
}

The result of running the Ogun algorithm.

Fields

positions: HashMap<NodeId, Pos>

Final position of each placed node.

paths: HashMap<EdgeId, Vec<Pos>>

Routed path for each edge (sequence of grid cells). Missing entries mean the edge could not be routed.

score: f32

Composite optimization score in [0, 1].

Trait Implementations

impl Clone for Layout

fn clone(&self) -> Layout

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Layout

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Layout

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Layout

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

where __S: Serializer,

Serialize this value into the given Serde serializer.