通过K条指定链路的最小生成树方法

Journal of Graphic Era University Pub Date : 2023-10-02 DOI:10.13052/jgeu0975-1416.1127

Santosh Kumar, Elias Munapo, Philimon Nyamugure, Trust Tawanda

{"title":"通过K条指定链路的最小生成树方法","authors":"Santosh Kumar, Elias Munapo, Philimon Nyamugure, Trust Tawanda","doi":"10.13052/jgeu0975-1416.1127","DOIUrl":null,"url":null,"abstract":"This paper presents a minimum spanning tree approach to find a path through ‘k’ specified links. This problem has many real-life applications and unlike the shortest route, the path through specified links may have loops. The proposed method determines the route, which may either be an optimal or a near optimal path. It may also contain loops.","PeriodicalId":489098,"journal":{"name":"Journal of Graphic Era University","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum Spanning Tree Approach to Path Through K Specified Links\",\"authors\":\"Santosh Kumar, Elias Munapo, Philimon Nyamugure, Trust Tawanda\",\"doi\":\"10.13052/jgeu0975-1416.1127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a minimum spanning tree approach to find a path through ‘k’ specified links. This problem has many real-life applications and unlike the shortest route, the path through specified links may have loops. The proposed method determines the route, which may either be an optimal or a near optimal path. It may also contain loops.\",\"PeriodicalId\":489098,\"journal\":{\"name\":\"Journal of Graphic Era University\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graphic Era University\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.13052/jgeu0975-1416.1127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graphic Era University","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13052/jgeu0975-1416.1127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种最小生成树方法来寻找通过k个指定链接的路径。这个问题在现实生活中有很多应用，而且与最短路由不同，通过指定链路的路径可能有环路。该方法确定路径，该路径可以是最优路径，也可以是接近最优路径。它也可能包含循环。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Minimum Spanning Tree Approach to Path Through K Specified Links

This paper presents a minimum spanning tree approach to find a path through ‘k’ specified links. This problem has many real-life applications and unlike the shortest route, the path through specified links may have loops. The proposed method determines the route, which may either be an optimal or a near optimal path. It may also contain loops.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Graphic Era University

自引率

0.00%

发文量