You can start drawing the MST by clicking on canvas.
Click to Add | Right-Click to Remove.
Generated by Prim's Algorithm using Euclidean Distances as weights of graph
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible.
Task Scheduling can be done via Topological Sorting.
Topological Sorting is applicable only on DAGs.
Topological Sorting by Kahn's Algorithm using List of tasks below
In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another; in this application, a topological ordering is just a valid sequence for the tasks. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG)