Comments for Tarjan class about neo HOT 2 OPEN

Initialization:
    The constructor initializes the list of vertices.
    The components LinkedList will store the found SCCs.
    The stack is used to manage the nodes during the depth-first search.

Invoke Method:
    Iterates through all vertices and invokes StrongConnectNonRecursive on unvisited vertices (those with DFN < 0).

StrongConnect Method:
    This is the recursive method for finding SCCs.
    It assigns a DFN and LowLink value to the current vertex, pushes it onto the stack, and marks it as on the stack.
    It iterates over all successors of the vertex, recursively visits unvisited successors, and updates the LowLink value.
    If the vertex is a root of an SCC, it pops vertices from the stack to form the SCC.

StrongConnectNonRecursive Method:
    This is the non-recursive version of the SCC search using an explicit stack to simulate the call stack.
    It follows a similar logic to the recursive method but uses a state machine approach to manage the depth-first search and backtracking.

Ensure that the StackItem type T has DFN, LowLink, OnStack, and Successors properties or fields, as these are used extensively in the algorithm.
The ReferenceEqualityComparer.Instance is assumed to provide a way to compare objects by reference, which is necessary for correctly forming SCCs.