{"title":"实现最短路径算法","authors":"Amruta Amruta, Sneha Pawar, Bharati Bhamare","doi":"10.32628/ijsrset2411261","DOIUrl":null,"url":null,"abstract":"An important area of study that models the relationships between items is called graph theory. The shortest path between two objects is one of the most important concepts in graph theory. Many algorithms, such as Dijkstra's Algorithm, Prim’s Algorithm, Floyd Warshall Algorithm have been created for this purpose.","PeriodicalId":14228,"journal":{"name":"International Journal of Scientific Research in Science, Engineering and Technology","volume":"52 13","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementation of Shortest Path Algorithms\",\"authors\":\"Amruta Amruta, Sneha Pawar, Bharati Bhamare\",\"doi\":\"10.32628/ijsrset2411261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An important area of study that models the relationships between items is called graph theory. The shortest path between two objects is one of the most important concepts in graph theory. Many algorithms, such as Dijkstra's Algorithm, Prim’s Algorithm, Floyd Warshall Algorithm have been created for this purpose.\",\"PeriodicalId\":14228,\"journal\":{\"name\":\"International Journal of Scientific Research in Science, Engineering and Technology\",\"volume\":\"52 13\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Scientific Research in Science, Engineering and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.32628/ijsrset2411261\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Scientific Research in Science, Engineering and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32628/ijsrset2411261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An important area of study that models the relationships between items is called graph theory. The shortest path between two objects is one of the most important concepts in graph theory. Many algorithms, such as Dijkstra's Algorithm, Prim’s Algorithm, Floyd Warshall Algorithm have been created for this purpose.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
