Topological Sort

The topological sort algorithm is used for a lot of things, particularly scheduling. Its input is a directed acyclic graph (which can be drawn by taking a simple undirected graph and giving each edge a direction). The output of the algorithm will be an ordering of the nodes in terms of their "importance". This is important in things such as job scheduling where certain jobs must be completed before others. Performing a topological sort on the set of jobs can give an overall ordering of when to start each job.

your browser does not support the canvas tag

Recent Updates

  • 03-20-2017 Longest Common Subsequence at LEARNINGLOVER.COM
  • 10-27-2016 Independent Set Puzzles
  • 06-28-2016 Lets Learn About XOR Encryption
  • 06-15-2016 Discrete-time Markov Chains
  • 03-01-2016 Topological Sort
  • 01-21-2016 The RSA Algorithm
  • 11-20-2015 How To Take Notes in Math Class
  • 10-28-2015 The Depth-First-Search Algorithm
  • 10-28-2015 The Breadth-First-Search Algorithm
  • 09-23-2015 ID3 Algorithm Decision Trees
  • 07-08-2015 Clique Problem Puzzles
  • 06-25-2015 Unidirectional TSP Puzzles
  • 04-04-2015 Learn About Descriptive Statistics
  • 02-19-2015 Slope Formula
  • 01-15-2015 Interactive Midpoint Formula
  • 12-18-2014 Triangle Sum Puzzle
  • 12-02-2014 The Bridge Crossing Problem
  • 11-26-2014 Magical Squares Game
  • 11-07-2014 QR Decomposition
  • 09-12-2014 The A* Algorithm