Wellcome to GRAPH THEORY

WE'RE

Help you find the shortest path using Dijkstra and Prim algorithms

team-img
Dijkstra

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent

Prim

Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph

More

More algorithms are being updated ...