CyclesEnumeratorJohnson (JGAlgo - Parent 0.5.0 API)

java.lang.Object

com.jgalgo.alg.cycle.CyclesEnumeratorAbstract

com.jgalgo.alg.cycle.CyclesEnumeratorJohnson

All Implemented Interfaces:: CyclesEnumerator

public class CyclesEnumeratorJohnson extends CyclesEnumeratorAbstract

Johnson's algorithm for finding all cycles in a directed graph.

The algorithm runs in \(O((n+m)(c+1))\) time and \(O(n + m)\) space where \(c\) is the number of simple cycles in the graph.

Based on the paper 'finding all the elementary circuits of a directed graph' by Donald b. Johnson.

Author:: Barak Ugav

Constructor Summary

Constructors

Constructor

Description

CyclesEnumeratorJohnson()

Create a new cycles finder algorithm object.
Method Summary

Methods inherited from class com.jgalgo.alg.cycle.CyclesEnumeratorAbstract
cyclesIter

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- CyclesEnumeratorJohnson
  
  public CyclesEnumeratorJohnson()
  
  Create a new cycles finder algorithm object.
  Please prefer using CyclesEnumerator.newInstance() to get a default implementation for the CyclesEnumerator interface.