We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2a8227e commit 6ca394fCopy full SHA for 6ca394f
src/graph/eulerian_path.rs
@@ -55,11 +55,12 @@ impl EulerianPathSolver {
55
}
56
57
58
- /// Computes the Eulerian path if it exists.
+ /// Find the Eulerian path if it exists.
59
///
60
/// # Returns
61
62
/// An `Option<Vec<usize>>` containing the Eulerian path if found; otherwise, `None`.
63
+ ///
64
/// If multiple Eulerian paths exist, the one found will be returned, but it may not be unique.
65
fn find_path(&mut self) -> Option<Vec<usize>> {
66
self.initialize_degrees();
@@ -94,7 +95,7 @@ impl EulerianPathSolver {
94
95
96
97
- /// Checks if an Eulerian path is possible in the graph.
98
+ /// Checks if an Eulerian path exists in the graph.
99
100
101
0 commit comments