-
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.
MultiobjectiveLS generic types explained [skip ci]
- Loading branch information
Pablo Rodríguez Mier
committed
Nov 8, 2014
1 parent
27e4747
commit 7f3676e
Showing
1 changed file
with
5 additions
and
1 deletion.
There are no files selected for viewing
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 |
---|---|---|
|
@@ -32,7 +32,11 @@ | |
* Original paper: | ||
* Martins, E. D. Q. V., & Santos, J. L. E. (1999). <b>"The labeling algorithm for the multiobjective shortest path problem"</b>. <i>Departamento de Matematica, Universidade de Coimbra, Portugal, Tech. Rep. TR-99/005</i>. | ||
* | ||
* @param <S> type of the states used by the algorithm | ||
* @param <A> action type. | ||
* @param <S> state type. | ||
* @param <C> comparable cost used to compare states. | ||
* @param <N> type of the heuristic search node used. | ||
* | ||
* @author Pablo Rodríguez Mier <<a href="mailto:[email protected]">[email protected]</a>> | ||
*/ | ||
public class MultiobjectiveLS<A,S,C extends Comparable<C>,N extends HeuristicNode<A,S,C,N>> extends Algorithm<A,S,N> { | ||
|