Category: Graph

  Chess Knights Tour implementation in java. A knight’s tour is a sequence of moves of a knight on a chessboard such that the knight visits every square

Breadth first search : Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary

Depth First Search : Depth-first search (DFS) is an algorithm for traversing graph data structures. One starts at the root and explores as far as possible along each

We have a list of N nodes with each node pointing to one of the N nodes. It could even be pointing to itself. We call a node