## Graphs: Dijkstra’s Algorithm

Dijkstra’s algorithm is a very useful tool to find the shortest distance between any two nodes in a weighted graph. For now we will stick to an explanation of the algorithm, which will be short and to-the-point in keeping with the function of the algorithm.

This is an algorithm used to traverse a graph consisting of nodes and edges. In this, we traverse a graph “breadth-wise”. This means we visit all the nodes of the graph by going down the different levels of the graph. However, this poses a problem.

## Machine Learning: Decision Tree Regressor in Python

This post discusses decision trees for regression from a machine learning point of view and includes a python implementation of the same.

## Smurf Paths Dunjudge Editorial

An editorial to a interesting problem present on dunjudge. It involves the fantastic use of graphs along with segment tree.

## Graphs: An Overview

A graph is a data structure composed of nodes(vertices) and edges. Simple, I know. Not enough to …..

## Depth First Traversal

This is an algorithm that is used to traverse a graph Depth-wise. We move forward in depth and visit all the adjacent nodes of a given starting node.