blob: b776db7a45a5fb9da268324de825f1a8f562a6b2 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/*******************************************************************************
* Copyright (c) 2010-2014, Miklos Foldenyi, Andras Szabolcs Nagy, Abel Hegedus, Akos Horvath, Zoltan Ujhelyi and Daniel Varro
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v. 2.0 which is available at
* http://www.eclipse.org/legal/epl-v20.html.
*
* SPDX-License-Identifier: EPL-2.0
*******************************************************************************/
package org.eclipse.viatra.dse.api;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
public class Solution {
private Set<SolutionTrajectory> trajectories;
private final Object stateId;
public Solution(Object stateId, SolutionTrajectory trajectory) {
this.stateId = stateId;
trajectories = new HashSet<>();
trajectories.add(trajectory);
}
public void addTrajectory(SolutionTrajectory trajectory) {
trajectories.add(trajectory);
}
public SolutionTrajectory getArbitraryTrajectory() {
return trajectories.iterator().next();
}
public SolutionTrajectory getShortestTrajectory() {
Iterator<SolutionTrajectory> iterator = trajectories.iterator();
SolutionTrajectory shortestTrajecotry = iterator.next();
int minSize = shortestTrajecotry.getTrajectoryLength();
while (iterator.hasNext()) {
SolutionTrajectory traj = iterator.next();
int size = traj.getTrajectoryLength();
if (size < minSize) {
shortestTrajecotry = traj;
minSize = size;
}
}
return shortestTrajecotry;
}
public Collection<SolutionTrajectory> getTrajectories() {
return trajectories;
}
public Object getStateCode() {
return stateId;
}
}
|