|
Class Summary |
| Algorithm |
Serves as a superclass of all algorithms for Jedit. |
| BlockFinding |
Finds various blocks in a graph. |
| BlocksMerger |
An animated implementation of Blocks Merger algorithm. |
| BreadthSearch |
An animated implementation of the Breadth-First Search algorithm, starting at the vertex the user clicks on.
|
| CanonicalOrdering |
An animated implementation of the Canonical Ordering algorithm. |
| Center |
Finds the center of a given graph. |
| ComponentSearch |
Finds the individual components in a graph. |
| DegreeSequence |
Generates a representative graph based on a series of degrees of vertices (whole numbers). |
| DeleteAllEdges |
Deletes all edges in a graph. |
| DepthSearch |
An animated implementation of the Depth-First Search algorithm.
|
| Dijkstra1 |
Finds the shortest path between a vertex the user clicks on and all other vertices using Dijkstra's Shortest Path algorithm. |
| Dijkstra2 |
Finds the shortest path between two vertices the user clicks on using Dijkstra's Shortest Path algorithm. |
| EulerianWalk |
Finds the Eulerian Walk of a graph. |
| Floyd |
An animated implementation of the Floyd-Warshall Shortest Path algorithm. |
| Fragments |
An animated implementation of the Fragments algorithm. |
| HavelHakimi |
|
| Heawood |
Creates a Heawood graph. |
| Hypercube |
Constructs a Hypercube graph of 2n vertices, 2n-1n edges, 2n-3n(n-1) squares, and n(n-1)(n-2)2n-4/3 cubes. |
| Kmn |
Creates a Km,n graph. |
| Kn |
Creates a Kn graph. |
| MaxFlowMinCut |
An animated implementation of Max-Flow Min-Cut Algorithm. |
| MaximalPlanar |
An animated implementation of Maximal Planar algorithm. |
| Median |
Finds the Median of a given graph. |
| NetworkFlow |
Runs a Breadth-First search starting at a vertex clicked on by the user. |
| Petersen |
Creates a Petersen graph. |
| PlanarityDrawing |
An animated implementation of the Planarity Drawing algorithm. |
| PlanarityTesting |
An implementation of the Planarity Testing algorithm. |
| Prim |
Finds a minimum spanning tree using Prim's Algorithm. |
| PruferCode |
Takes a Tree and produces the corresponding Prufer Code. |
| PruferTree |
Produces a Tree from a user-supplied Prufer Code. |
| Queue |
An implementation of a Queue of integers. |