Skip to content

Commit

Permalink
Restore some typos for testing the PR comment
Browse files Browse the repository at this point in the history
  • Loading branch information
airwoodix committed Nov 29, 2024
1 parent c897caa commit 535f167
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
2 changes: 1 addition & 1 deletion rustworkx-core/src/max_weight_matching.rs
Original file line number Diff line number Diff line change
Expand Up @@ -371,7 +371,7 @@ fn expand_blossom<E>(
// base.
assert!(label_ends[blossom].is_some());
let entry_child = in_blossoms[endpoints[label_ends[blossom].unwrap() ^ 1]];
// Decide in which direction we will go around the blossom.
// Decied in which direction we will go around the blossom.
let i = blossom_children[blossom]
.iter()
.position(|x| *x == entry_child)
Expand Down
2 changes: 1 addition & 1 deletion tests/graph/test_bellman_ford.py
Original file line number Diff line number Diff line change
Expand Up @@ -175,7 +175,7 @@ def test_raises_negative_cycle_bellman_ford_paths(self):
with self.assertRaises(rustworkx.NegativeCycle):
rustworkx.bellman_ford_shortest_paths(graph, 0, weight_fn=float)

def test_raises_negative_cycle_bellman_ford_path_lengths(self):
def test_raises_negative_cycle_bellman_ford_path_lenghts(self):
graph = rustworkx.PyGraph()
graph.add_nodes_from(list(range(4)))
graph.add_edges_from(
Expand Down

0 comments on commit 535f167

Please sign in to comment.