1 files changed, 60 insertions, 0 deletions

diff --git a/Solvers/VIATRA-Solver/org.eclipse.viatra.dse/src/org/eclipse/viatra/dse/api/Solution.java b/Solvers/VIATRA-Solver/org.eclipse.viatra.dse/src/org/eclipse/viatra/dse/api/Solution.java
new file mode 100644
index 00000000..b776db7a
--- /dev/null
+++ b/Solvers/VIATRA-Solver/org.eclipse.viatra.dse/src/org/eclipse/viatra/dse/api/Solution.java
@@ -0,0 +1,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;

+    }

+

+}