-
Notifications
You must be signed in to change notification settings - Fork 89
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
63308b7
commit 47925de
Showing
1 changed file
with
28 additions
and
0 deletions.
There are no files selected for viewing
28 changes: 28 additions & 0 deletions
28
...usc/citius/hipster/algorithm/problem/romanian/IDAStarRomaniaProblemOptimalSearchTest.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
package es.usc.citius.hipster.algorithm.problem.romanian; | ||
|
||
import es.usc.citius.hipster.algorithm.Hipster; | ||
import es.usc.citius.hipster.model.HeuristicNode; | ||
import es.usc.citius.hipster.model.problem.SearchProblem; | ||
import es.usc.citius.hipster.util.examples.RomanianProblem; | ||
import es.usc.citius.hipster.util.graph.GraphSearchProblem; | ||
|
||
import java.util.Iterator; | ||
|
||
/** | ||
* @author Adrián González Sieira <[email protected]> | ||
* @since 31/07/2014 | ||
*/ | ||
public class IDAStarRomaniaProblemOptimalSearchTest extends RomaniaProblemOptimalSearchTest{ | ||
|
||
@Override | ||
public Iterator<HeuristicNode<Double, RomanianProblem.City, Double, ?>> createIterator() { | ||
SearchProblem p = GraphSearchProblem | ||
.startingFrom(RomanianProblem.City.Arad) | ||
.in(graph) | ||
.takeCostsFromEdges() | ||
.useHeuristicFunction(RomanianProblem.heuristicFunction()) | ||
.build(); | ||
|
||
return Hipster.createIDAStar(p).iterator(); | ||
} | ||
} |