src/test/java/de/dfki/lt/loot/digraph/algo/TestAStarShortestPath.java
@Test
  public void testAStarDirEuclid()
      throws IOException {
    Graph<Double> g = new DiGraph<Double>();
    String[] res = { "z", "y", "x", "u" };
    testAStar(g, false, "s", "u", res);
  }
/**
   * Directed Graph, Euclidean Distance estimate.
   */
Directed Graph, Euclidean Distance estimate.
Directed Graph Euclidean Distance estimate .
@Test
  public void testAStarDirEuclid()
      throws IOException {
    Graph<Double> g = new DiGraph<Double>();
    String[] res = { "z", "y", "x", "u" };
    testAStar(g, false, "s", "u", res);
  }
@ Test public void testAStarDirEuclid ( ) throws IOException { Graph < Double > g = new DiGraph < Double > ( ) ; String [ ] res = { "z" , "y" , "x" , "u" } ; testAStar ( g , false , "s" , "u" , res ) ; }
Directed Graph, Euclidean Distance estimate.
Directed Graph Euclidean Distance estimate .