Package | Description |
---|---|
org.jgrapht.experimental.dag |
Experimental package with directed acyclic graphs.
|
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).
|
Copyright © 2016. All rights reserved.