public class ElementGraphs extends Object
ElementGraph
.Modifier and Type | Method and Description |
---|---|
static void |
addSinks(BaseFlowStep flowStep,
ElementGraph elementGraph,
Set<Tap> sinks) |
static void |
addSources(BaseFlowStep flowStep,
ElementGraph elementGraph,
Set<Tap> sources) |
static ElementGraph |
asExtentMaskedSubGraph(ElementGraph elementGraph)
Returns a new ElementGraph (a MaskedSubGraph) of the given ElementGraph that will not contain the
Extent
head or tail instances. |
static ElementSubGraph |
asSubGraph(ElementGraph elementGraph,
ElementGraph contractedGraph,
Set<FlowElement> excludes) |
static String |
canonicalHash(ElementGraph graph) |
static String |
canonicalHash(org.jgrapht.Graph<FlowElement,Scope> graph) |
static org.jgrapht.DirectedGraph<FlowElement,Scope> |
directed(ElementGraph elementGraph) |
static boolean |
equals(ElementGraph lhs,
ElementGraph rhs) |
static boolean |
equalsIgnoreAnnotations(ElementGraph lhs,
ElementGraph rhs) |
static <V,E> boolean |
equalsIgnoreAnnotations(org.jgrapht.Graph<V,E> lhs,
org.jgrapht.Graph<V,E> rhs) |
static Set<Group> |
findAllGroups(ElementGraph elementGraph) |
static Set<HashJoin> |
findAllHashJoins(ElementGraph elementGraph) |
static <V,E> Pair<Set<V>,Set<E>> |
findClosureViaFloydWarshall(org.jgrapht.DirectedGraph<V,E> full,
org.jgrapht.DirectedGraph<V,E> contracted) |
static <V,E> Pair<Set<V>,Set<E>> |
findClosureViaFloydWarshall(org.jgrapht.DirectedGraph<V,E> full,
org.jgrapht.DirectedGraph<V,E> contracted,
Set<V> excludes) |
static Pipe |
findFirstPipeNamed(ElementGraph elementGraph,
String name) |
static Pipe |
findLastPipeNamed(ElementGraph elementGraph,
String name) |
static Set<Tap> |
findSinks(ElementGraph elementGraph) |
static <F extends FlowElement> |
findSinks(ElementGraph elementGraph,
Class<F> type) |
static Set<Tap> |
findSources(ElementGraph elementGraph) |
static <F extends FlowElement> |
findSources(ElementGraph elementGraph,
Class<F> type) |
static <V,E> List<org.jgrapht.GraphPath<V,E>> |
getAllShortestPathsBetween(org.jgrapht.DirectedGraph<V,E> graph,
V from,
V to) |
static List<org.jgrapht.GraphPath<FlowElement,Scope>> |
getAllShortestPathsBetween(ElementGraph graph,
FlowElement from,
FlowElement to) |
static Iterator<FlowElement> |
getReverseTopologicalIterator(ElementGraph graph) |
static Iterator<FlowElement> |
getTopologicalIterator(ElementGraph graph) |
static int |
hashCodeIgnoreAnnotations(ElementGraph elementGraph) |
static <V,E> int |
hashCodeIgnoreAnnotations(org.jgrapht.Graph<V,E> graph) |
static void |
insertFlowElementAfter(ElementGraph elementGraph,
FlowElement previousElement,
FlowElement flowElement) |
static void |
insertFlowElementBefore(ElementGraph graph,
FlowElement nextElement,
FlowElement flowElement) |
protected static int |
pair(int lhs,
int rhs) |
static boolean |
printElementGraph(String filename,
ElementGraph graph,
PlatformInfo platformInfo) |
static boolean |
printProcessGraph(String filename,
ElementGraph graph,
ProcessGraph<? extends ProcessModel> processGraph) |
static void |
removeAndContract(ElementGraph elementGraph,
FlowElement flowElement) |
static boolean |
removeBranchBetween(ElementGraph elementGraph,
FlowElement first,
FlowElement second,
boolean inclusive) |
static boolean |
removeBranchContaining(ElementGraph elementGraph,
FlowElement flowElement) |
static void |
replaceElementWith(ElementGraph elementGraph,
FlowElement replace,
FlowElement replaceWith) |
static int |
shortestDistance(ElementGraph graph,
FlowElement lhs,
FlowElement rhs)
Returns the number of edges found on the shortest distance between the lhs and rhs.
|
public static org.jgrapht.DirectedGraph<FlowElement,Scope> directed(ElementGraph elementGraph)
public static int hashCodeIgnoreAnnotations(ElementGraph elementGraph)
public static <V,E> int hashCodeIgnoreAnnotations(org.jgrapht.Graph<V,E> graph)
public static boolean equalsIgnoreAnnotations(ElementGraph lhs, ElementGraph rhs)
public static <V,E> boolean equalsIgnoreAnnotations(org.jgrapht.Graph<V,E> lhs, org.jgrapht.Graph<V,E> rhs)
public static boolean equals(ElementGraph lhs, ElementGraph rhs)
public static String canonicalHash(ElementGraph graph)
public static String canonicalHash(org.jgrapht.Graph<FlowElement,Scope> graph)
protected static int pair(int lhs, int rhs)
public static Iterator<FlowElement> getTopologicalIterator(ElementGraph graph)
public static Iterator<FlowElement> getReverseTopologicalIterator(ElementGraph graph)
public static List<org.jgrapht.GraphPath<FlowElement,Scope>> getAllShortestPathsBetween(ElementGraph graph, FlowElement from, FlowElement to)
public static <V,E> List<org.jgrapht.GraphPath<V,E>> getAllShortestPathsBetween(org.jgrapht.DirectedGraph<V,E> graph, V from, V to)
public static ElementSubGraph asSubGraph(ElementGraph elementGraph, ElementGraph contractedGraph, Set<FlowElement> excludes)
public static ElementGraph asExtentMaskedSubGraph(ElementGraph elementGraph)
Extent
head or tail instances.
If the given ElementGraph does not contain head or tail, it will be returned unchanged.elementGraph
- public static <V,E> Pair<Set<V>,Set<E>> findClosureViaFloydWarshall(org.jgrapht.DirectedGraph<V,E> full, org.jgrapht.DirectedGraph<V,E> contracted)
public static <V,E> Pair<Set<V>,Set<E>> findClosureViaFloydWarshall(org.jgrapht.DirectedGraph<V,E> full, org.jgrapht.DirectedGraph<V,E> contracted, Set<V> excludes)
public static void removeAndContract(ElementGraph elementGraph, FlowElement flowElement)
public static boolean printElementGraph(String filename, ElementGraph graph, PlatformInfo platformInfo)
public static boolean printProcessGraph(String filename, ElementGraph graph, ProcessGraph<? extends ProcessModel> processGraph)
public static void insertFlowElementAfter(ElementGraph elementGraph, FlowElement previousElement, FlowElement flowElement)
public static void insertFlowElementBefore(ElementGraph graph, FlowElement nextElement, FlowElement flowElement)
public static void addSources(BaseFlowStep flowStep, ElementGraph elementGraph, Set<Tap> sources)
public static Set<Tap> findSources(ElementGraph elementGraph)
public static <F extends FlowElement> Set<F> findSources(ElementGraph elementGraph, Class<F> type)
public static <F extends FlowElement> Set<F> findSinks(ElementGraph elementGraph, Class<F> type)
public static void addSinks(BaseFlowStep flowStep, ElementGraph elementGraph, Set<Tap> sinks)
public static Set<Tap> findSinks(ElementGraph elementGraph)
public static Set<Group> findAllGroups(ElementGraph elementGraph)
public static Set<HashJoin> findAllHashJoins(ElementGraph elementGraph)
public static void replaceElementWith(ElementGraph elementGraph, FlowElement replace, FlowElement replaceWith)
public static Pipe findFirstPipeNamed(ElementGraph elementGraph, String name)
public static Pipe findLastPipeNamed(ElementGraph elementGraph, String name)
public static boolean removeBranchContaining(ElementGraph elementGraph, FlowElement flowElement)
public static boolean removeBranchBetween(ElementGraph elementGraph, FlowElement first, FlowElement second, boolean inclusive)
public static int shortestDistance(ElementGraph graph, FlowElement lhs, FlowElement rhs)
Copyright © 2007-2015 Concurrent, Inc. All Rights Reserved.