Package com.jgalgo.example

Simple examples using the basics of com.jgalgo.graph and algorithms.

Class Summary

Class	Description
BfsDfsExample	This example demonstrates how to use the BFS and DFS algorithms.
ColoringExample	This example demonstrates how to use the coloring algorithm.
EdgeIterationExample	This example demonstrates how to iterate over the edges of a graph.
LowestCommonAncestorExample	This example demonstrates how to use the lowest common ancestor algorithm.
MaximumMatchingExample	This example demonstrates how to use the maximum matching algorithm.
MinimumSpanningTreeExample	This example demonstrates how to use the minimum spanning tree algorithm.
ShortestPathExample	This example demonstrates how to use the single-source shortest path algorithm.