Modifier and Type	Class and Description
pack-priv static class	Graph.Builder<T>
pack-priv static class	Graph.Edge<T>
pack-priv static class	Graph.TopoSorter<T> Topological sort

Modifier and Type	Field and Description
private final Map<T, Set<T>>	edges
private final Set<T>	nodes

Access	Constructor and Description
public	Graph(Set<T> nodes, Map<T, Set<T>> edges)

Method Summary

Modifier and Type	Method and Description
public Set<T>	adjacentNodes(T u)
public boolean	contains(T u)
public Set<T>	dfs(Set<T> roots) Returns all nodes reachable from the given set of roots.
public Map<T, Set<T>>	edges()
public Set<Graph.Edge<T>>	edgesFrom(T u)
private boolean	isAdjacent(T u, T v)
public Set<T>	nodes()
public void	ordered(Consumer<T> action) Traverse this graph and performs the given action in topological order
public Stream<T>	orderedNodes() Returns nodes sorted in topological order.
private boolean	pathExists(T u, T v)
private boolean	pathExists(T u, T v, boolean includeAdjacent) Returns true if there exists a path from u to v in this graph.
public void	printGraph(PrintWriter out)
public Graph<T>	reduce() Returns a new Graph after transitive reduction
public Graph<T>	reduce(Graph<T> g) Returns a new Graph after transitive reduction.
public void	reverse(Consumer<T> action) Traverses this graph and performs the given action in reverse topological order
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
public Graph<T>	transpose() Returns a transposed graph from this graph

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

edges	back to summary
private final Map<T, Set<T>> edges

nodes	back to summary
private final Set<T> nodes

Graph	back to summary
public Graph(Set<T> nodes, Map<T, Set<T>> edges)

Method Detail

adjacentNodes	back to summary
public Set<T> adjacentNodes(T u)

contains	back to summary
public boolean contains(T u)

dfs	back to summary
public Set<T> dfs(Set<T> roots) Returns all nodes reachable from the given set of roots.

edges	back to summary
public Map<T, Set<T>> edges()

edgesFrom	back to summary
public Set<Graph.Edge<T>> edgesFrom(T u)

isAdjacent	back to summary
private boolean isAdjacent(T u, T v)

nodes	back to summary
public Set<T> nodes()

ordered	back to summary
public void ordered(Consumer<T> action) Traverse this graph and performs the given action in topological order

orderedNodes	back to summary
public Stream<T> orderedNodes() Returns nodes sorted in topological order.

pathExists	back to summary
private boolean pathExists(T u, T v)

pathExists	back to summary
private boolean pathExists(T u, T v, boolean includeAdjacent) Returns true if there exists a path from u to v in this graph. If includeAdjacent is false, it returns true if there exists another path from u to v of distance > 1

printGraph	back to summary
public void printGraph(PrintWriter out)

reduce	back to summary
public Graph<T> reduce() Returns a new Graph after transitive reduction

reduce	back to summary
public Graph<T> reduce(Graph<T> g) Returns a new Graph after transitive reduction. All edges in the given g takes precedence over this graph. Exceptions IllegalArgumentException: g must be a subgraph this graph

reduce

back to summary

public Graph<T> reduce(Graph<T> g)

Returns a new Graph after transitive reduction. All edges in the given g takes precedence over this graph.

Exceptions

IllegalArgumentException:: g must be a subgraph this graph

reverse	back to summary
public void reverse(Consumer<T> action) Traverses this graph and performs the given action in reverse topological order

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned. Annotations @Override

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Annotations

@Override

transpose	back to summary
public Graph<T> transpose() Returns a transposed graph from this graph

com.sun.tools.jdeps back to summary

pack-priv Class Graph.Builder<T>

Class Inheritance

extends Object

java.lang.Object
com.sun.tools.jdeps.Graph.Builder

Known Direct Subclasses

com.sun.tools.jdeps.ModuleGraphBuilder

Field Summary

Modifier and Type	Field and Description
pack-priv final Map<T, Set<T>>	edges
pack-priv final Set<T>	nodes

Constructor Summary

Access	Constructor and Description
pack-priv	Builder()

Method Summary

Modifier and Type	Method and Description
public void	addEdge(T u, T v)
public void	addNode(T node)
public void	addNodes(Set<T> nodes)
public Graph<T>	build()

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

edges	back to summary
pack-priv final Map<T, Set<T>> edges

nodes	back to summary
pack-priv final Set<T> nodes

Constructor Detail

Builder	back to summary
pack-priv Builder()

Method Detail

addEdge	back to summary
public void addEdge(T u, T v)

addNode	back to summary
public void addNode(T node)

addNodes	back to summary
public void addNodes(Set<T> nodes)

build	back to summary
public Graph<T> build()

com.sun.tools.jdeps back to summary

pack-priv Class Graph.Edge<T>

Class Inheritance

extends Object

java.lang.Object
com.sun.tools.jdeps.Graph.Edge

Field Summary

Modifier and Type	Field and Description
pack-priv final T	u
pack-priv final T	v

Constructor Summary

Access	Constructor and Description
pack-priv	Edge(T u, T v)

Method Summary

Modifier and Type	Method and Description
public boolean	equals(Object o) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for this object.
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll wait wait wait

Field Detail

u	back to summary
pack-priv final T u

v	back to summary
pack-priv final T v

Constructor Detail

Edge	back to summary
pack-priv Edge(T u, T v)

Method Detail

equals back to summary

equals	back to summary
public boolean equals(Object o) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Annotations @Override

public boolean equals(Object o)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Annotations

@Override

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables. Annotations @Override

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Annotations

@Override

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned. Annotations @Override

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Annotations

@Override

public final Class Graph<T>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class Graph.Builder<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class Graph.Edge<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class Graph.TopoSorter<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

Modifier and Type	Method and Description
public void	ordered(Consumer<T> action)
public void	reverse(Consumer<T> action)
private void	sort()
private void	visit(T node, Set<T> visited, Set<T> done)