Edge e2 = new Edge(c2, c3);
Edge e3 = new Edge(c3, c4);
Edge e4 = new Edge(c4, c5);
- edges = new LinkedList(Arrays.asList(e0, e1, e2, e3, e4));
+ // actually need a LinkedList because we're going to .remove()
+ edges = new LinkedList<Edge>(Arrays.asList(e0, e1, e2, e3, e4));
} catch (ConstructionException e) {
// Exception is NOT expected if raised test will fail
Assert.assertTrue(false);
Edge e2 = new Edge(c2, c3);
Edge e3 = new Edge(c3, c4);
Edge e4 = new Edge(c4, c5);
- edges1 = new LinkedList(Arrays.asList(e0, e1, e2, e3, e4));
+ edges1 = Arrays.asList(e0, e1, e2, e3, e4);
} catch (ConstructionException e) {
// Exception is NOT expected if raised test will fail
Assert.assertTrue(false);
Edge e2 = new Edge(c2, c3);
Edge e3 = new Edge(c3, c4);
Edge e4 = new Edge(c4, c5);
- edges2 = new LinkedList(Arrays.asList(e0, e1, e2, e3, e4));
+ edges2 = Arrays.asList(e0, e1, e2, e3, e4);
} catch (ConstructionException e) {
// Exception is NOT expected if raised test will fail
Assert.assertTrue(false);
Edge e2 = new Edge(c2, c3);
Edge e3 = new Edge(c3, c4);
Edge e4 = new Edge(c4, c5);
- edges3 = new LinkedList(Arrays.asList(e0, e1, e2, e3, e4));
+ edges3 = Arrays.asList(e0, e1, e2, e3, e4);
} catch (ConstructionException e) {
// Exception is NOT expected if raised test will fail
Assert.assertTrue(false);
Edge e0 = new Edge(c0, c1);
- Path path = new Path(new LinkedList(Arrays.asList(e0)));
+ Path path = new Path(Arrays.asList(e0));
} catch (ConstructionException e) {
// Exception is NOT expected if raised test will fail
Assert.assertTrue(false);
Edge e2 = new Edge(c2, c3);
Edge e3 = new Edge(c3, c4);
Edge e4 = new Edge(c4, c5);
- List<Edge> edges = new LinkedList(Arrays.asList(e0, e1, e2, e3, e4));
+ List<Edge> edges = Arrays.asList(e0, e1, e2, e3, e4);
Path path = new Path(edges);
// Test start node
(short) 0x1), n1);
Edge e0 = new Edge(c0, c1);
- List<Edge> edges = new LinkedList(Arrays.asList(e0));
+ List<Edge> edges = Arrays.asList(e0);
Path path = new Path(edges);
// Test start node