Ever wondered how to solve a maze effectively?

41*41 Maze will be solved effectively using DFS Algorithm

Above is the given maze that we will be solving using DFS algorithm. The Green block and the Red block are the starting and ending point respectively.

But first what is DFS ?

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures.
In simple words using some traversing technique, we can visit all the nodes of a graph in a certain order that we define.

Iteration or Recursion ?

Of course we will be using Iteration because lets face it, we all hate Recursion (technically I don’t understand recursion 😥😥).

Data Structures we will be using :-


In this article we will create a docker-compose.yaml file for nodejs and MYSQL application.
If you want to look at the code then go to my github repo

Dockerize nodejs and mysql

Content

What is Docker?

Docker is an open platform for developing, shipping, and running applications.
It provides the ability to package and run an application in a loosely isolated environment called a container.
Containers are lightweight and contain everything needed to run the application, so you do not need to rely on what is currently installed on the host. …


Today Topological sort will tell you how to dress like a man 😄

Dressing Order by Topological Sort

Table of Content:

What is a Graph?

A graph is a simple non-linear data structure consisting of Nodes and Edges (Node are also referred to as Vertices). An edge connects a pair of nodes. Generally a graph is represented as G(u, v) where ‘u’ and ‘v’ are vertices.

In the below graph we have A,B,C,D,E vertices and edges connecting them.
This is a Directed Graph(edges are directed from one vertex to another).

Shubham Verma

Learning DS & Algo

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store