Package com.intellij.util.graph

Class GraphAlgorithms

java.lang.Object

com.intellij.util.graph.GraphAlgorithms

Direct Known Subclasses:

GraphAlgorithmsImpl

public abstract class GraphAlgorithms
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
GraphAlgorithms()

Method Summary

Modifier and Type	Method and Description
abstract <Node> void	collectOutsRecursively(Graph<Node> graph, Node start, java.util.Set<? super Node> set) Adds start node and all its outs to given set recursively.
abstract <Node> Graph<Chunk<Node>>	computeSCCGraph(Graph<Node> graph)
abstract <Node> java.util.Collection<Chunk<Node>>	computeStronglyConnectedComponents(Graph<Node> graph)
abstract <Node> java.util.Set<java.util.List<Node>>	findCycles(Graph<Node> graph, Node node)
abstract <Node> java.util.List<java.util.List<Node>>	findKShortestPaths(Graph<Node> graph, Node start, Node finish, int k, ProgressIndicator progressIndicator)
abstract <Node> java.util.List<Node>	findShortestPath(Graph<Node> graph, Node start, Node finish) Deprecated. use more generic findShortestPath(InboundSemiGraph, Object, Object) instead
abstract <Node> java.util.List<Node>	findShortestPath(InboundSemiGraph<Node> graph, Node start, Node finish)
static GraphAlgorithms	getInstance()
abstract <Node> Graph<Node>	invertEdgeDirections(Graph<Node> graph)
abstract <Node> java.util.List<java.util.List<Node>>	removePathsWithCycles(java.util.List<? extends java.util.List<Node>> paths)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphAlgorithms

public GraphAlgorithms()

Method Detail

getInstance

public static GraphAlgorithms getInstance()

findShortestPath

@Deprecated
public abstract <Node> java.util.List<Node> findShortestPath(Graph<Node> graph,
                                                             Node start,
                                                             Node finish)

Deprecated. use more generic findShortestPath(InboundSemiGraph, Object, Object) instead

findShortestPath

public abstract <Node> java.util.List<Node> findShortestPath(InboundSemiGraph<Node> graph,
                                                             Node start,
                                                             Node finish)

findKShortestPaths

public abstract <Node> java.util.List<java.util.List<Node>> findKShortestPaths(Graph<Node> graph,
                                                                               Node start,
                                                                               Node finish,
                                                                               int k,
                                                                               ProgressIndicator progressIndicator)

findCycles

public abstract <Node> java.util.Set<java.util.List<Node>> findCycles(Graph<Node> graph,
                                                                      Node node)

removePathsWithCycles

public abstract <Node> java.util.List<java.util.List<Node>> removePathsWithCycles(java.util.List<? extends java.util.List<Node>> paths)

invertEdgeDirections

public abstract <Node> Graph<Node> invertEdgeDirections(Graph<Node> graph)

computeStronglyConnectedComponents

public abstract <Node> java.util.Collection<Chunk<Node>> computeStronglyConnectedComponents(Graph<Node> graph)

computeSCCGraph

public abstract <Node> Graph<Chunk<Node>> computeSCCGraph(Graph<Node> graph)

collectOutsRecursively

public abstract <Node> void collectOutsRecursively(Graph<Node> graph,
                                                   Node start,
                                                   java.util.Set<? super Node> set)

Adds start node and all its outs to given set recursively. Nodes which are already in set aren't processed.

Parameters:

start - node to start from

set - set to be populated