class to get set of vertices in a cycle given a serialized jgrapht object
output number of vertices and edges
change path finder in addAccessToGraph() so it looks for directed paths
make Graph in DisplayGraph general (directed or undirected)
print a notice in DisplayGraph if graph is empty
remove ConnectivityFinder field as it is no longer being used
implement thread-local graphs that periodicaly merge to global graph
longer period between graph unions
(every 5 lock releases)
implemented union method in AbstractBaseGraph
Unions in SyncBlocksStats now uses that method instead of GraphUnion class
use random access file to serialize graph
move CycleFinder and DisplayGraph java files to src
do cycle detection in fini method
serialize graph with cycles
print out more information about strongly connected components
comment out counter output
add instrumentation to see how many nodes in strongly connected component
have more than one out edge
fix edge/vertex masked bug
was masking all vertices that should be in graph
and showing all vertices that should be masked
implementation of Johnson's algorithm to find simple cycles
use Johnson's algorithm to count simple cycles
tests for johnsons simple cycle finder
use values flag to get accessed value
null pointer bug fix
only add adjacent nodes to B-list if in strongly connected component
filter all vertices not in a cycle from graph before running johnson's
stop keeping track of which vertices are in a cycle in johnson's
update with eclipse
add node merging implementation
using BlockEdge to hold source location in edges