| Class | Description |
|---|---|
| CompleteGraphDemo |
Demonstrates how to create a complete graph and perform a depth first search on it.
|
| DependencyDemo |
This class is a demonstration program for creating a dependency chart, directed graph, then
locating and outputting any implicit loops, cycles.
|
| DirectedGraphDemo |
This class demonstrates some of the operations that can be performed on directed graphs.
|
| GraphBuilderDemo |
Demonstrates how to use
GraphTypeBuilder and GraphBuilder. |
| GraphMLDemo |
This class demonstrates exporting and importing a graph with custom vertex and edge attributes in
GraphML.
|
| HelloJGraphT |
A simple introduction to using JGraphT.
|
| JGraphXAdapterDemo |
A demo applet that shows how to use JGraphX to visualize JGraphT graphs.
|
| LabeledEdges |
An example of how to apply edge labels using a custom edge class.
|
| ParberryKnightTour |
Implementation of <a href = "https://doi.org/10.1016/S0166-218X(96)00010-8">
Parberry's algorithm</a> for
<a href = "https://en.wikipedia.org/wiki/Knight%27s_tour">closed knight's tour
problem</a>.
|
| PerformanceDemo |
A simple demo to test memory and CPU consumption on a graph with 3 million elements.
|
| WarnsdorffRuleKnightTourHeuristic |
Implementation of <a href =
"https://en.wikipedia.org/wiki/Knight%27s_tour#Warnsdorf's_rule">Warnsdorff's
rule</a> - heuristic for finding a knight's tour on chessboards.
|
Copyright © 2019. All rights reserved.