diff options
| author | bjculkin <bjculkin@mix.wvu.edu> | 2017-03-24 09:54:17 -0400 |
|---|---|---|
| committer | bjculkin <bjculkin@mix.wvu.edu> | 2017-03-24 09:54:17 -0400 |
| commit | 41c2a41eaf3c2dd158a2a51947180f402918229e (patch) | |
| tree | 47cbe22f24c7c0898ae9154734973846224332d8 /BJC-Utils2/src/main/java/bjc/utils/graph | |
| parent | b0d27faf67ec23b3d55786e00d4fd3b0d07567ee (diff) | |
Implement Pratt parser.
Diffstat (limited to 'BJC-Utils2/src/main/java/bjc/utils/graph')
| -rw-r--r-- | BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java b/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java index 694aa02..003b996 100644 --- a/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java +++ b/BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java @@ -174,7 +174,9 @@ public class Graph<T> { forAllEdgesMatchingAt(source.getValue(), (target, weight) -> { return !visited.contains(target); }, (target, weight) -> { - available.add(new Edge<>(source.unwrap(vertex -> vertex), target, weight)); + T vert = source.unwrap(vertex -> vertex); + + available.add(new Edge<>(vert, target, weight)); }); // Get the edge with the minimum distance |