@article{Kumar OAM_Munapo_Nyamugure_Tawanda_2024, title={Path Through Specified Nodes and Links in a Network}, volume={12}, url={https://journal.riverpublishers.com/index.php/JGEU/article/view/371}, DOI={10.13052/jgeu0975-1416.1225}, abstractNote={<p>A constrained shortest route problem in graph theory is about determination of a shortest path between two given nodes of the network that also visits a given set of specified nodes or a set of specified links before arriving to the destination. These earlier approaches did not consider specified elements containing both nodes and links of the given network. This paper finds a shortest path joining the origin node to the destination node, which is constrained to pass through a set of âKâ specified elements of the given network, where K<sub>1</sub> number of elements represent nodes, 0&lt;K<sub>1</sub>&lt;K, and K<sub>2</sub> number of elements represent links, where K<sub>1</sub>+K<sub>2</sub>=K. Alternatively, if the specified elements representing nodes are contained in the set S<sub>n</sub> and the remaining elements representing links by the set S<sub>l</sub>, and the set of specified elements denoted by the set S<sub>e</sub>, then S<sub>e</sub>={S<sub>n </sub>âŞ S<sub>l</sub>}. Such restricted path will also have real-life applications. Depending upon the configuration of the specified elements, these constrained paths may have loops. The approach discussed in this paper is a heuristic approach, which finds the required constrained path in a real time.</p>}, number={02}, journal={Journal of Graphic Era University}, author={Kumar OAM, Santosh and Munapo, Elias and Nyamugure, Philimon and Tawanda, Trust}, year={2024}, month={Sep.}, pages={263â282} }