## Dijkstra’s Shortest Path Algorithm in Java, easy in 5 minutes

Today, I introduce you to Dijkstra’s Shortest Path Algorithm in Java, both concept and implementation. Dijkstra’s algorithm is one of the common algorithms and here is implemented with a graph in the adjacent matrix. Dijkstra’s Shortest Path Algorithm in Java What’s Dijkstra’s algorithm? Dijkstra’s algorithm has many variants but the most common one is to … Read moreDijkstra’s Shortest Path Algorithm in Java, easy in 5 minutes

## Prim’s Algorithm Minimum Spanning Tree in Java, easy in 5 minutes

Today, I introduce you to Prim’s Algorithm Minimum Spanning Tree in Java and how to use it finding the minimum spanning tree. Sometimes, Prim’s Algorithm is called Minimum Spanning Tree (MST) algorithm, it takes a graph as input and produces a MST tree. Prim’s Algorithm Minimum Spanning Tree in Java What’s Prim’s Algorithm? Prim’s algorithm … Read morePrim’s Algorithm Minimum Spanning Tree in Java, easy in 5 minutes

## Implement Graph Adjacency List in Java, easy in 5 minutes

Today, you will study how to implement Graph Adjacency List in Java. It’s easy for you to understand if you have basic knowledge about Graph data structure, but you don’t, please refer to the post Graph Data Structure in Java. Now, let’s find out what we study today. Implement Graph Adjacency List in Java Adjacency … Read moreImplement Graph Adjacency List in Java, easy in 5 minutes

## Graph Data Structure in Java, easy in 5 minutes

The post introduces Graph Data Structure in Java, both concept and implementation. A graph data structure is a collection of nodes that are connected to other nodes. Every connection is an edge from one node to another. Let’s dig deeper. Graph Data Structure in Java Graph example Now, you can try to discovery a bit … Read moreGraph Data Structure in Java, easy in 5 minutes

## Delete a node in Binary Search Tree, easy in 5 minutes

You just have basic knowledge about Binary Search Tree (BST). Now, it’s time to study about delete a node in Binary Search Tree. It is quite different from operations like searching and insertion a node in BST. Delete a node in Binary Search Tree There are three cases since doing deletion of a node in … Read moreDelete a node in Binary Search Tree, easy in 5 minutes