PRIM'S

ALGORITHM
GREEDY ALGORITHM
NATURE OF PRIM'S ALGORITHM
Prim's Algorithm is a greedy algorithm
that aims to find a minimum spanning
tree (MST) for a connected, weighted
graph. It starts with a single vertex
and repeatedly grows the MST by
adding the cheapest edge that
connects the tree to a new vertex
until all vertices are included.
UNIQUENESS OF PRIM'S ALGORITHM

Prim's Algorithm guarantees

that the resulting spanning
tree will have the minimum
possible weight among all
possible spanning trees for
the given graph. It focuses
on adding the cheapest
edges and ensures that the
MST is always connected.
HOW DOES IT WORK?
 TIME COMPLEXITY
The time complexity of Prim's algorithm depends on the data structure used:

Adjacency Matrix, Searching - O(V²)

Binary Heap and Adjacency List - O(E * logV)

Adjacency Matrix Binary Heap and Adjacency List

In each iteration of the algorithm, we In this case, finding the vertex with the
need to find the vertex with the minimum key value can be done efficiently
minimum key value. Since this operation in O(logV) time using the binary heap.
needs to be performed V times, the Since this operation needs to be performed
overall time complexity becomes O(V²). for each of the edges, the total time
complexity becomes O(E * logV).
 PRIM'S ALGORITHM FOR OPTIMIZING FIBER OPTIC TRAJECTORY PLANNING
Muhammad Iqbal, Andysah Putera Utama Siahaan, Nathania Elizabeth Purba, Dedi Purwanto

Problem to be solved

The transition from copper cable to fiber optic technology is driving the need for
quick and accurate data transmission. However, fiber optic cables are expensive and
must be installed optimally to minimize costs.

Solution proposed by the researcher

To address this, the researcher proposes using Prim's algorithm to calculate the
minimum spanning tree and optimize cable installation. This algorithm helps
interconnect points efficiently, reducing the time required to reach a destination and
saving costs in fiber optic construction.
Results of the testing

Prim's algorithm is effective in searching for notes with the shortest weights, and
this process can be applied to fiber optic cabling.
The algorithm consistently produces sides that are part of the minimum spanning
tree, which helps optimize cable installation and reduce construction costs.

Recommendations

Prim's algorithm is efficient and effective for most cases, but it may take a long
time to check the existence of circuits against the formed spanning tree in graphs
with many circuits.
In branch graphs with a large number of circuits, such as complete graphs, the
algorithm may become an obstacle in the graduation problem.
Despite these limitations, the algorithm is still considered suitable for the
development of fiber optic lines to prevent unnecessary costs.
PRIM ALGORITHM APPROACH TO IMPROVING LOCAL ACCESS NETWORK IN RURAL AREAS

Arogundade O. T., Sobowale B., and Akinwale A. T.

Problem to be solved

The research aims to address the challenge of designing local access networks in rural
areas in Nigeria. The goal is to select a network configuration that maximizes the
difference between the total cost of network connections and the total profits of the
villages.

Solution proposed by the researcher

The researchers suggest using Prim's algorithm to solve the minimum spanning tree
problem, which helps determine the most profitable network configuration. The
algorithm's effectiveness is demonstrated in a case study involving 88 villages in
Nigeria, highlighting its potential for efficient and profitable local access network
design.
Results of the testing

The algorithm used in the study was found to be highly effective in providing
the shortest distance between sets of villages.
The algorithm's effectiveness resulted in a reduction in the cost of fuel and time
for transportation of passengers between towns, which directly impacts
transportation prices in Nigeria.

Recommendations

The paper can serve as a guide for implementing the algorithm in other local
governments in Nigeria to improve the transportation of goods and services
effectively.
The method can be further explored and utilized by other organizations that aim
to achieve their goals with reduced costs and effective resource utilization.
The algorithm's applicability extends beyond transportation and can be
explored in areas such as electrical installation, pipe water distribution, and
telecommunication, among others.
References

Iqbal, M., Siahaan, A. P. U., Elizabeth, N., & Purwanto, D. (2017). Prim’s algorithm for Optimizing Fiber Optic Trajectory
Planning. International Journal of Scientific Research in Science and Technology. 3. 504-509.
https://www.researchgate.net/publication/319349574_Prim%27s_Algorithm_for_Optimizing_Fiber_Optic_Trajectory_Planning

Arogundade, O. ’., Sobowale, B., & Akinwale, A. T. (2011). Prim Algorithm approach to improving local access network in rural
areas. International Journal of Computer Theory and Engineering, 413–417. https://doi.org/10.7763/ijcte.2011.v3.340