public LinkedList<Dependency> findDeadlock() {
    return graph.findCycle();
  }
Finds the first deadlock in the list of dependencies, or null if there are no deadlocks in the
set of dependencies.

@return a linked list of dependencies which shows the circular dependencies. The List will be
        of the form Dependency(A,B), Dependency(B,C), Dependency(C, A).
geode-core/src/main/java/org/apache/geode/distributed/internal/deadlock/DeadlockDetector.java