src/test/java/de/dfki/lt/loot/digraph/algo/TestAStarShortestPath.java
@Test
  public void testAStarUndirEuclid()
      throws IOException {
    Graph<Double> g = new UndirectedGraph<Double>();
    String[] res = { "v", "u" };
    testAStar(g, false, "s", "u", res);
  }
/**
   * Undirected Graph, Euclidean Distance estimate: this produces a non-optimal
   * solution since the estimate is not admissible! The euclidean distance
   * to the endpoint may be misleading since not all directions are possible!
   */
Undirected Graph, Euclidean Distance estimate: this produces a non-optimal
solution since the estimate is not admissible. The euclidean distance
to the endpoint may be misleading since not all directions are possible!
Undirected Graph Euclidean Distance estimate : this produces a non - optimal solution since the estimate is not admissible . The euclidean distance to the endpoint may be misleading since not all directions are possible!
@Test
  public void testAStarUndirEuclid()
      throws IOException {
    Graph<Double> g = new UndirectedGraph<Double>();
    String[] res = { "v", "u" };
    testAStar(g, false, "s", "u", res);
  }
@ Test public void testAStarUndirEuclid ( ) throws IOException { Graph < Double > g = new UndirectedGraph < Double > ( ) ; String [ ] res = { "v" , "u" } ; testAStar ( g , false , "s" , "u" , res ) ; }
Undirected Graph, Euclidean Distance estimate: this produces a non-optimal
 solution since the estimate is not admissible!
Undirected Graph Euclidean Distance estimate : this produces a non - optimal solution since the estimate is not admissible!