Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- @Test
- public void testCaminhoMenorDificuldade() {
- Local l1 = new Local("Local1", 0);
- Local l2 = new Local("Local2", 0);
- Local l3 = new Local("Local3", 0);
- Local l4 = new Local("Local4", 0);
- Local l5 = new Local("Local5", 0);
- AdjacencyMatrixGraph<Local, Estrada> grafo = new AdjacencyMatrixGraph<>();
- grafo.insertVertex(l1);
- grafo.insertVertex(l2);
- grafo.insertVertex(l3);
- grafo.insertVertex(l4);
- grafo.insertVertex(l5);
- grafo.insertEdge(l1, l2, new Estrada(3));
- grafo.insertEdge(l1, l4, new Estrada(50));
- grafo.insertEdge(l1, l5, new Estrada(9));
- grafo.insertEdge(l2, l3, new Estrada(3));
- grafo.insertEdge(l3, l4, new Estrada(12));
- RedeEstradas redeEstradas = new RedeEstradas(grafo);
- LinkedList<Local> result = redeEstradas.caminhoMenorDificuldade(l1, l4);
- LinkedList<Local> expected = new LinkedList<>();
- expected.addLast(l1);
- expected.addLast(l2);
- expected.addLast(l3);
- expected.addLast(l4);
- assertEquals(result, expected);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement