Skip to content

word-graph: fix follow_path return type #348

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
james-d-mitchell merged 1 commit into from
Nov 7, 2025
Merged

word-graph: fix follow_path return type #348

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/word-graph.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -760,7 +760,7 @@ The word graphs *x* and *y* are equal at a node *s* if:
m.def(
"word_graph_follow_path",
[](WordGraph_ const& wg, node_type from, word_type const& path) {
return word_graph::follow_path(wg, from, path);
return from_int(word_graph::follow_path(wg, from, path));
},
py::arg("wg"),
py::arg("from"),
Expand Down
3 changes: 3 additions & 0 deletions tests/test_word_graph.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -137,6 +137,9 @@ def test_follow_path(word_graphs):
with pytest.raises(LibsemigroupsError):
word_graph.follow_path(wg1, 6, [0])

wg1.init(1, 2)
assert word_graph.follow_path(wg1, 0, [0] * 6) == UNDEFINED


def test_is_acyclic(word_graphs):
wg1, wg2 = word_graphs
Expand Down