diff options
| author | Jonas Smedegaard <dr@jones.dk> | 2025-05-01 13:59:52 +0200 |
|---|---|---|
| committer | Jonas Smedegaard <dr@jones.dk> | 2025-05-01 14:00:31 +0200 |
| commit | d9104886d48c8a176997519dc6d6427d7a58795b (patch) | |
| tree | da1675ed512e38821672c9d16f1ed2d9f7d75622 | |
| parent | 274ae82c32b91526c4c5d658f6bdbe03b7d13308 (diff) | |
tighten javadoc description
| -rw-r--r-- | src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java index 23f4819..cebdb0e 100644 --- a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java +++ b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java @@ -262,10 +262,10 @@ public final class Graph extends Storage { return bestPathCost; } - /// finds lengh of random path through disjoint module choices + /// find total weight of random path through disjoint choice sets /// /// @param g sets of disjoint choices as a graph - /// @return weight of final random path + /// @return total weight of random path private static int solve(final AbstractGraph g) { List<Vertex> path = new ArrayList<>(g.vertices()); |