Package | Description |
---|---|
org.helenus.commons.collections | |
org.helenus.commons.collections.graph |
Modifier and Type | Method and Description |
---|---|
static <T> DirectedGraph<T> |
GraphUtils.reverse(DirectedGraph<T> g)
Gets the reverse of the input graph.
|
Modifier and Type | Method and Description |
---|---|
static <T> DirectedGraph<T> |
GraphUtils.reverse(DirectedGraph<T> g)
Gets the reverse of the input graph.
|
static <T> List<T> |
GraphUtils.reverseSort(DirectedGraph<T> g)
Sorts the specified directed graph and obtains a reversed topological
sorting of the nodes in the graph.
|
static <T> List<T> |
GraphUtils.reverseSort(DirectedGraph<T> g,
java.util.function.Function<T,?> omapper,
java.util.function.Function<T,String> smapper)
Sorts the specified directed graph and obtains a topological sorting of
the nodes in the graph.
|
static <T> List<T> |
GraphUtils.reverseSort(DirectedGraph<T> g,
java.util.function.Function<T,String> smapper)
Sorts the specified directed graph and obtains a topological sorting of
the nodes in the graph.
|
static <T> List<T> |
GraphUtils.sort(DirectedGraph<T> g)
Sorts the specified directed graph and obtains a topological sorting of
the nodes in the graph.
|
static <T> List<T> |
GraphUtils.sort(DirectedGraph<T> g,
java.util.function.Function<T,?> omapper,
java.util.function.Function<T,String> smapper)
Sorts the specified directed graph and obtains a topological sorting of
the nodes in the graph.
|
static <T> List<T> |
GraphUtils.sort(DirectedGraph<T> g,
java.util.function.Function<T,String> smapper)
Sorts the specified directed graph and obtains a topological sorting of
the nodes in the graph.
|
Modifier and Type | Class and Description |
---|---|
class |
ConcurrentHashDirectedGraph<T>
The
ConcurrentHashDirectedGraph class provides an implementation
of the DirectedGraph interface that uses a ConcurrentHashMap
to keep track of the graph. |
Copyright (C) 2015-2017 The Helenus Driver Project Authors.