modules diagram: always highlight dependencies from cycles

This commit is contained in:
nik
2011-06-10 13:18:00 +04:00
parent 4c7544b049
commit a3d03ea4b6
2 changed files with 0 additions and 22 deletions
@@ -18,7 +18,6 @@ package com.intellij.util.graph;
import com.intellij.openapi.components.ServiceManager;
import com.intellij.openapi.progress.ProgressIndicator;
import com.intellij.util.Chunk;
import com.intellij.util.containers.MultiMap;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
@@ -50,6 +49,4 @@ public abstract class GraphAlgorithms {
public abstract <Node> Graph<Node> invertEdgeDirections(@NotNull Graph<Node> graph);
public abstract <Node> Graph<Chunk<Node>> computeSCCGraph(final Graph<Node> graph);
public abstract <Node> Graph<Node> createGraphByInArcs(MultiMap<Node, Node> inArcs);
}
@@ -17,7 +17,6 @@ package com.intellij.util.graph.impl;
import com.intellij.openapi.progress.ProgressIndicator;
import com.intellij.util.Chunk;
import com.intellij.util.containers.MultiMap;
import com.intellij.util.graph.*;
import gnu.trove.TIntArrayList;
import gnu.trove.TIntProcedure;
@@ -111,24 +110,6 @@ public class GraphAlgorithmsImpl extends GraphAlgorithms {
}));
}
@Override
public <Node> Graph<Node> createGraphByInArcs(final MultiMap<Node, Node> inArcs) {
final Set<Node> nodes = new LinkedHashSet<Node>();
nodes.addAll(inArcs.keySet());
nodes.addAll(inArcs.values());
return new GraphGenerator<Node>(new CachingSemiGraph<Node>(new GraphGenerator.SemiGraph<Node>() {
@Override
public Collection<Node> getNodes() {
return nodes;
}
@Override
public Iterator<Node> getIn(Node n) {
return inArcs.get(n).iterator();
}
}));
}
@NotNull
@Override
public <Node> List<List<Node>> removePathsWithCycles(@NotNull List<List<Node>> paths) {