A cycle is a path of edges and vertices wherein a vertex is reachable from itself

An algorithm for finding the shortest paths between nodes in a graph

A trail in a finite graph which visits every edge exactly once.

Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once

A game consists of three rods and a number of disks of different sizes

A minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest

A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph

Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?

A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid. How many possible unique paths are there?

The Levenshtein distance is a string metric for measuring the difference between two sequences