src/main/java/de/dfki/lt/loot/digraph/algo/AStarShortestPath.java
public List<Edge<EdgeInfo>> shortestPath(Graph<EdgeInfo> g,
      int startVertex, int endVertex, OrderedMonoid<T> weightOps,
      Function<Edge<EdgeInfo>, T> getWeight, final Function<Integer, T> h) {
    List<Integer> end = new ArrayList<Integer>(1);
    end.add(endVertex);
    return shortestPath(g, startVertex, end, weightOps, getWeight, h);
  }
/** Return the shortest path between startVertex and endVertex */
Return the shortest path between startVertex and endVertex
Return the shortest path between startVertex and endVertex
public List<Edge<EdgeInfo>> shortestPath(Graph<EdgeInfo> g,
      int startVertex, int endVertex, OrderedMonoid<T> weightOps,
      Function<Edge<EdgeInfo>, T> getWeight, final Function<Integer, T> h) {
    List<Integer> end = new ArrayList<Integer>(1);
    end.add(endVertex);
    return shortestPath(g, startVertex, end, weightOps, getWeight, h);
  }
public List < Edge < EdgeInfo > > shortestPath ( Graph < EdgeInfo > g , int startVertex , int endVertex , OrderedMonoid < T > weightOps , Function < Edge < EdgeInfo > , T > getWeight , final Function < Integer , T > h ) { List < Integer > end = new ArrayList < Integer > ( 1 ) ; end . add ( endVertex ) ; return shortestPath ( g , startVertex , end , weightOps , getWeight , h ) ; }
Return the shortest path between startVertex and endVertex
Return the shortest path between startVertex and endVertex