Package org.jungrapht.samples.sugiyama
Sample applications using Sugiyama layout and contributing algorithms Current features demonstrated in the samples include:
- BrandesKopf horizontal coordinate assignment
- Eisperger optimization
- LongestPath algorithm
- NetworkSimplex algorithm
- Coffman Graham algorithm
-
Class Summary Class Description BrandesKopfSugiyamaGraphExample Fast and Simple Horizontal Coordinate Assignment by Ulrik Brandes and Boris Köpf on page 39, shows four horizontal coordinate assignments, plus the average median.BrandesKopfSugiyamaGraphExampleWithIsolatedVertices BrandesKopfSugiyamaGraphExampleWithLayouts BrandesKopfTestGraphExample Builds a test graph from the Brandes-Kopf paper, layers the graph, then manually sets all the synthetic vertices and edges to make a good starting point for the Brandes-Kopf Horizontal Coordinate Assignment algorithm.EiglspergerLayeringOptions shows the 4 layering options for the Eiglsperger optimized version of the Sugiyama layout algorithmEiglspergerLayoutDemo EiglspergerLongestPathComparison compares top-down and longest-path layeringEiglspergerMulticomponent Demo that uses the EiglspergerLayoutAlgorithm to display a directed graph that has several components (not connected to each other by any edges).EiglspergerMulticomponentComparison Demo that uses the EiglspergerLayoutAlgorithm to display a directed graph that has several components (not connected to each other by any edges).EiglspergerNetworkSimplex EiglspergerNetworkSimplexComparison EiglspergerSmallGraph EiglspergerSmallGraphWithGraph EiglspergerSmallNetworkSimplexComparison EiglspergerWithWithoutTransposeSwapping EiglspsergerSixTestGraphExample LayeredTestGraphExample Builds a test graph from the BrandesKopf paper, layers the graph, then manually sets all the synthetic vertices and edges.MinCrossMulticomponent Demo that uses the EiglspergerLayoutAlgorithm to display a directed graph that has several components (not connected to each other by any edges).SugiyamaAndEiglsperger Compares the original sugiyama layout with the Eiglsperger optimized version.SugiyamaAndEiglspergerAttributed SugiyamaEiglspergerWithWithoutHorizontalCompaction Demonstrates the original sugiyama layout algorithm with and without edge straightening Also shows the Eiglsperger optimized sugiyama layout algorithm with/without edge straightening.SugiyamaLayeringOptions Demonstrates 4 layering algorithms with the SugiyamaLayoutAlgoithmSugiyamaLayoutDemo sample program using the SugiyamaLayoutAlgorithmSugiyamaMulticomponent Demo that uses the EiglspergerLayoutAlgorithm to display a directed graph that has several components (not connected to each other by any edges).SugiyamaSixTestGraphExample Shows the four HorizontalCompaction algorithms, plus the average median for SugiyamaLayoutAlgorithmSugiyamaWithWithoutStraighteningGraphExample SugiyamaWithWithoutTransposeSwapping