From 41c2a41eaf3c2dd158a2a51947180f402918229e Mon Sep 17 00:00:00 2001
From: bjculkin <bjculkin@mix.wvu.edu>
Date: Fri, 24 Mar 2017 09:54:17 -0400
Subject: Implement Pratt parser.

---
 BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

(limited to 'BJC-Utils2/src/main/java/bjc/utils/graph/Graph.java')

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
-- 
cgit v1.2.3