#algorithms

Topics tagged "algorithms".

• Breadth-First Search

  Explore a graph in concentric layers from a source — the simplest way to find shortest paths in an unweighted graph.

• Depth-First Search

  Plunge as deep as possible along each branch, then backtrack — the traversal behind spanning trees, cycle detection, and topological order.

• Dijkstra's Algorithm

  Find the cheapest route in a weighted graph by greedily settling the nearest unfinished node, one at a time.

• Minimum Spanning Tree

  The cheapest set of edges that connects every node of a weighted graph without forming a loop.

• PageRank

  A node's importance is the long-run chance a random surfer following links lands on it — the dominant eigenvector of the link matrix.