public class Acyclic extends Object
Modifier and Type | Field and Description |
---|---|
static int |
THRESHOLD_FOR_NONRECURSIVE_DFS |
Modifier and Type | Method and Description |
---|---|
static <T> Collection<Path> |
computeAcyclicPaths(NumberedGraph<T> G,
T root,
T src,
T sink,
int max)
Compute a set of acyclic paths through a graph G from a node src to a node sink.
|
static <T> IBinaryNaturalRelation |
computeBackEdges(NumberedGraph<T> G,
T root)
Compute a relation R s.t.
|
static <T> boolean |
hasIncomingBackEdges(Path p,
NumberedGraph<T> G,
T root) |
static <T> boolean |
isAcyclic(NumberedGraph<T> G,
T root)
This is slow.
|
public static final int THRESHOLD_FOR_NONRECURSIVE_DFS
public static <T> boolean isAcyclic(NumberedGraph<T> G, T root)
public static <T> IBinaryNaturalRelation computeBackEdges(NumberedGraph<T> G, T root)
public static <T> boolean hasIncomingBackEdges(Path p, NumberedGraph<T> G, T root)
public static <T> Collection<Path> computeAcyclicPaths(NumberedGraph<T> G, T root, T src, T sink, int max)
max
- the max number of paths to return.