Ever wondered how to solve a maze effectively?
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.
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.
Of course we will be using Iteration because lets face it, we all hate Recursion (technically I don’t understand recursion 😥😥).
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
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 😄
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).
Learning DS & Algo