Yet another workaround for #281

This commit is contained in:
Peter Palaga
2021-01-04 17:38:50 +01:00
parent a81aa7c397
commit eb11f64db7
4 changed files with 24 additions and 13 deletions

View File

@@ -375,8 +375,8 @@ public class DependencyGraph<K> {
* Compute the set of nodes reachable from the given {@code node} through the {@code is upstream of} relation. The
* {@code node} itself is not a part of the returned set.
*
* @param node the node for which the transitive upstream should be computed
* @return the set of transitive upstreams
* @param node the node for which the transitive upstream should be computed
* @return the set of transitive upstreams
*/
Set<K> transitiveUpstreams(K node) {
Set<K> result = transitiveUpstreams.get(node);