Dépôt du be graphe
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

DijkstraAlgorithmTests.java 632B

12345678910111213141516171819202122
  1. package org.insa.graphs.algorithm.utils;
  2. import org.insa.graphs.algorithm.shortestpath.BellmanFordAlgorithm;
  3. import org.insa.graphs.algorithm.shortestpath.DijkstraAlgorithm;
  4. import org.insa.graphs.algorithm.shortestpath.ShortestPathAlgorithm;
  5. import org.insa.graphs.algorithm.shortestpath.ShortestPathData;
  6. public class DijkstraAlgorithmTests extends ShortestPathTests{
  7. @Override
  8. protected ShortestPathAlgorithm getOracleAlgo(ShortestPathData data) {
  9. return new BellmanFordAlgorithm(data);
  10. }
  11. @Override
  12. protected ShortestPathAlgorithm getTesterAlgo(ShortestPathData data) {
  13. return new DijkstraAlgorithm(data);
  14. }
  15. }