Skip to content
Snippets Groups Projects
Commit 7587f7a9 authored by Simon Barner's avatar Simon Barner
Browse files

Avoid warning

parent cd6ba432
No related branches found
No related tags found
No related merge requests found
......@@ -32,12 +32,9 @@ import org.jgrapht.alg.interfaces.MinimumSpanningTree;
import org.jgrapht.graph.ListenableDirectedWeightedGraph;
/**
* Creates a Directed acyclic task graph of all the {@link IDeployableComponentAdapter}s.
* <li>Each
* {@link ISignalAdapter} is examined:</li>
* <li>If there exists no path between a target of the
* {@link ISignalAdapter} and it source, add an edge to the {@link DefaultTaskGraph}.</li>
* <li>
* Creates a Directed acyclic task graph of all the {@link IDeployableComponentAdapter}s. <li>Each
* {@link ISignalAdapter} is examined:</li> <li>If there exists no path between a target of the
* {@link ISignalAdapter} and it source, add an edge to the {@link DefaultTaskGraph}.</li> <li>
* Otherwise, a loop is detected. Then, the detected loop is cut either by not adding the edge (if
* the source vertex is strongly causal) or by removing an edge between the vertices (i.e.
* {@link IDeployableComponentAdapter}s) that are closest to the current {@link ISignalAdapter} by
......@@ -86,7 +83,6 @@ public class AcyclicTaskGraph extends DefaultTaskGraph implements TaskGraph {
}
/** {@inheritDoc} */
@SuppressWarnings("unchecked")
@Override
public AcyclicTaskGraph copy() {
AcyclicTaskGraph clonedTaskGraph;
......@@ -110,8 +106,8 @@ public class AcyclicTaskGraph extends DefaultTaskGraph implements TaskGraph {
* Transforms all existing {@link TaskGraph}s of {@code this} {@link TaskGraphEncoding} into
* {@link AcyclicTaskGraph}s.
*/
public static <T extends TaskGraph> Collection<AcyclicTaskGraph>
transformToAcyclicGraphs(Collection<T> cyclicTGs) {
public static <T extends TaskGraph> Collection<AcyclicTaskGraph> transformToAcyclicGraphs(
Collection<T> cyclicTGs) {
Collection<AcyclicTaskGraph> acyclicTGCollection = new ArrayList<>();
for(TaskGraph tg : cyclicTGs) {
AcyclicTaskGraph acycTG = new AcyclicTaskGraph(tg);
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment