Explore classic algorithms with interactive inputs
Find the optimal triangulation of a polygon to minimize total edge length cost
Enter polygon vertices in counter-clockwise order:
Find maximum flow from source to sink using Ford-Fulkerson algorithm
Enter the number of nodes and edge capacities:
For each node, enter outgoing edges as: destination capacity