## Uses of Interface
org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited

- Packages that use DirectedAcyclicGraph.Visited
  Package | Description
  --- | ---
  org.jgrapht.experimental.dag |

- - ### Uses of DirectedAcyclicGraph.Visited in org.jgrapht.experimental.dag

    Classes in org.jgrapht.experimental.dag that implement DirectedAcyclicGraph.Visited
    Modifier and Type | Class and Description
    --- | ---
    `static class` | `DirectedAcyclicGraph.VisitedArrayImpl` This implementation, somewhat to my surprise, is slower than the ArrayList version, probably due to its reallocation of the underlying array for every topology reorder that is required.
    `static class` | `DirectedAcyclicGraph.VisitedArrayListImpl` This implementation seems to offer the best performance in most cases.
    `static class` | `DirectedAcyclicGraph.VisitedBitSetImpl` This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage.
    `static class` | `DirectedAcyclicGraph.VisitedHashSetImpl` This implementation doesn't seem to perform as well, though I can imagine circumstances where it should shine (lots and lots of vertices).

    Methods in org.jgrapht.experimental.dag that return DirectedAcyclicGraph.Visited
    Modifier and Type | Method and Description
    --- | ---
    `DirectedAcyclicGraph.Visited` | DirectedAcyclicGraph.VisitedFactory.`getInstance(DirectedAcyclicGraph.Region affectedRegion)`
    `DirectedAcyclicGraph.Visited` | DirectedAcyclicGraph.VisitedBitSetImpl.`getInstance(DirectedAcyclicGraph.Region affectedRegion)`
    `DirectedAcyclicGraph.Visited` | DirectedAcyclicGraph.VisitedArrayListImpl.`getInstance(DirectedAcyclicGraph.Region affectedRegion)`
    `DirectedAcyclicGraph.Visited` | DirectedAcyclicGraph.VisitedHashSetImpl.`getInstance(DirectedAcyclicGraph.Region affectedRegion)`
    `DirectedAcyclicGraph.Visited` | DirectedAcyclicGraph.VisitedArrayImpl.`getInstance(DirectedAcyclicGraph.Region affectedRegion)`

Copyright © 2016. All rights reserved.