net.neoforged.jarcompatibilitychecker.sort

Class StronglyConnectedComponentDetector<T>

java.lang.Object

net.neoforged.jarcompatibilitychecker.sort.StronglyConnectedComponentDetector<T>

public class StronglyConnectedComponentDetector<T>
extends java.lang.Object

An object that splits a graph into strongly connected components lazily with Tarjan's Strongly Connected Components Algorithm.

This algorithm allows to detect all cycles in dependencies that prevent topological sorting.

This detector evaluates the graph lazily and won't reflect the modifications in the graph after initial evaluation.

Constructor Summary

Constructors

Constructor and Description
StronglyConnectedComponentDetector(com.google.common.graph.Graph<T> graph)

Method Summary

Modifier and Type	Method and Description
java.util.Set<java.util.Set<T>>	getComponents()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

StronglyConnectedComponentDetector

public StronglyConnectedComponentDetector(com.google.common.graph.Graph<T> graph)

Method Detail

getComponents

public java.util.Set<java.util.Set<T>> getComponents()