From cb07e6145cf26a9bbbe44fd06090a099030d0750 Mon Sep 17 00:00:00 2001 From: Jonathan Davies Date: Thu, 5 Jan 2023 11:09:25 +0000 Subject: Changed all instances of assignation to assignment. --- src/rpc/graph_algo.rs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/rpc/graph_algo.rs') diff --git a/src/rpc/graph_algo.rs b/src/rpc/graph_algo.rs index f181e2ba..65450d64 100644 --- a/src/rpc/graph_algo.rs +++ b/src/rpc/graph_algo.rs @@ -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 { 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(); -- cgit v1.2.3