Uses of Interface
de.xima.fc.utils.IValueGraphEdgePredicate

Packages that use IValueGraphEdgePredicate

Package	Description
de.xima.fc.interfaces.workflow.analysis
de.xima.fc.utils	Package für Utilsklassen

Uses of IValueGraphEdgePredicate in de.xima.fc.interfaces.workflow.analysis

Subinterfaces of IValueGraphEdgePredicate in de.xima.fc.interfaces.workflow.analysis

Modifier and Type	Interface	Description
interface	IFlowGraphFilterInstance	Filter for the nodes and edges of a workflow node flow graph,to exclude some existing nodes or edges.

Uses of IValueGraphEdgePredicate in de.xima.fc.utils

Methods in de.xima.fc.utils with parameters of type IValueGraphEdgePredicate

Modifier and Type	Method	Description
static <N, V> Set<N>	XGraphUtils.arrivingNodes(com.google.common.graph.ValueGraph<N,? extends V> graph, Iterable<? extends N> startNodes, IValueGraphEdgePredicate<? super N,? super V> edgeFilter)	Returns the set of nodes from which the node can be reached.
static <N, V> Set<N>	XGraphUtils.reachableNodes(com.google.common.graph.ValueGraph<N,? extends V> graph, Iterable<? extends N> startNodes, IValueGraphEdgePredicate<? super N,? super V> edgeFilter)	Taken from Graphs.reachableNodes(Graph, Object), but for value graphs and fixed so that a node is only reachable from itself when there exists has a 0+ loop cycle with the loop.