GitHub

Two C++ programs, one finds the minimum spanning tree of a graph using Prim's Algorithm, and the other finds the shortest path on a graph using Dijkstra's Algorithm.

"In computer science, Prim's (also known as Jarník's) algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that ...
GitHub

Prim-and-Dijkstra-Algorithms

"In computer science, Prim's (also known as Jarník's) algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that ...
IEEE

VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering algorithm

Abstract: Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information ...
IEEE

Tree Based EM-Prim's Algorithm For Energy Efficient Networking

Abstract: Network and networking equipment's are one of the biggest contributors to the consumption of energy. To reduce energy consumption in networks, many techniques and algorithms have been ...