A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is
The minimum spanning tree (MST) is a method that aims to find the minimum distance for connecting all vertices or nodes in a network of cities or any other centers. For finding the minimum distance that connects all nodes, two different types of algorithms have been commonly used: Kruskal and Prim algorithms. Our objective in this research is to find the most cost-efficient process for linking the natural gas pipeline's pathways in Istanbul using minimum spanning tree with randomness ordoi:10.31590/ejosat.1202232 fatcat:qfsy5wuovrb73di6w4kfdcdpua