## Least Cost Path in Weighted Digraph using BFS

Consider a directed graph where weight of its edges can be one of x, 2x or 3x (x is a given integer), compute the least cost path from source to destination efficiently.

Coding made easy

Consider a directed graph where weight of its edges can be one of x, 2x or 3x (x is a given integer), compute the least cost path from source to destination efficiently.

Given a N x N matrix of positive integers, find shortest path from the first cell of the matrix to its last cell that satisfies given constraints.

Given a binary matrix where 0 represents water and 1 represents land, count the number of islands in it. A island is formed by connected one’s. For example, consider below image. Above image highlights water in blue and land in grey in a 10 x 10 matrix. There are total five islands present in the above …

Flood fill (also known as seed fill) is an algorithm that determines the area connected to a given node in a multi-dimensional array.

Given a rectangular field with few sensors present on it, cross it by taking the shortest safe route without activating the sensors. The rectangular field is given in the form of M x N matrix and we need to find the shortest path from any cell in first column to any cell in the …

Given a maze in the form of the binary rectangular matrix, find length of the shortest path in a maze from given source to given destination.

Given a chess board, find the shortest distance (minimum number of steps) taken by a Knight to reach given destination from given source.

Given an connected undirected graph, find if it contains any cycle or not.

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 node of a graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first, before moving to the next level neighbors.