mirror of
https://github.com/deuxfleurs-org/garage.git
synced 2026-08-28 07:57:02 +00:00
Changed all instances of assignation to assignment.
This commit is contained in:
@@ -1,5 +1,5 @@
|
||||
//! This module deals with graph algorithms.
|
||||
//! It is used in layout.rs to build the partition to node assignation.
|
||||
//! It is used in layout.rs to build the partition to node assignment.
|
||||
|
||||
use rand::prelude::SliceRandom;
|
||||
use std::cmp::{max, min};
|
||||
@@ -177,7 +177,7 @@ impl Graph<FlowEdge> {
|
||||
let flow_upper_bound = self.flow_upper_bound()?;
|
||||
|
||||
// To ensure the dispersion of the associations generated by the
|
||||
// assignation, we shuffle the neighbours of the nodes. Hence,
|
||||
// assignment, we shuffle the neighbours of the nodes. Hence,
|
||||
// the vertices do not consider their neighbours in the same order.
|
||||
self.shuffle_edges();
|
||||
|
||||
|
||||
Reference in New Issue
Block a user