diff options
| author | Stefan Majer <stefan.majer@f-i-ts.de> | 2025-01-16 13:22:00 +0100 |
|---|---|---|
| committer | Stefan Majer <stefan.majer@f-i-ts.de> | 2025-01-16 13:22:00 +0100 |
| commit | 2eb9fcae20cb7e41b1197f4565db492a97f95736 (patch) | |
| tree | be9b2912ae92b07ef5e7905372b1bc2a542234c6 /src/rpc/layout/graph_algo.rs | |
| parent | 255b01b626096ef98cf24c9552b39c0372fb4eb3 (diff) | |
| download | garage-2eb9fcae20cb7e41b1197f4565db492a97f95736.tar.gz garage-2eb9fcae20cb7e41b1197f4565db492a97f95736.zip | |
Fix all typos
Diffstat (limited to 'src/rpc/layout/graph_algo.rs')
| -rw-r--r-- | src/rpc/layout/graph_algo.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/rpc/layout/graph_algo.rs b/src/rpc/layout/graph_algo.rs index bd33e97f..29d4a043 100644 --- a/src/rpc/layout/graph_algo.rs +++ b/src/rpc/layout/graph_algo.rs @@ -133,7 +133,7 @@ impl Graph<FlowEdge> { /// This function shuffles the order of the edge lists. It keeps the ids of the /// reversed edges consistent. fn shuffle_edges(&mut self) { - // We use deterministic randomness so that the layout calculation algorihtm + // We use deterministic randomness so that the layout calculation algorithm // will output the same thing every time it is run. This way, the results // pre-calculated in `garage layout show` will match exactly those used // in practice with `garage layout apply` |