用Dijkstra算法寻找最短路径

{"title":"用Dijkstra算法寻找最短路径","authors":"Vitala Seeta","doi":"10.37082/ijirmps.2021.v09si05.017","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":246139,"journal":{"name":"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finding the Shortest Path using Dijkstra’s Algorithm\",\"authors\":\"Vitala Seeta\",\"doi\":\"10.37082/ijirmps.2021.v09si05.017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":246139,\"journal\":{\"name\":\"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37082/ijirmps.2021.v09si05.017\",\"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 Innovative Research in Engineering & Multidisciplinary Physical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37082/ijirmps.2021.v09si05.017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}