以球形嗜中性数为弧长，用改进的Dijkstra算法求解最短路径

{"title":"以球形嗜中性数为弧长，用改进的Dijkstra算法求解最短路径","authors":"S. Behera, Prasanta Kumar Raut","doi":"10.1504/ijris.2023.10058359","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":38715,"journal":{"name":"International Journal of Reasoning-based Intelligent Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving shortest path using Modified Dijkstra's algorithm with spherical neutrosophic numbers as arc length\",\"authors\":\"S. Behera, Prasanta Kumar Raut\",\"doi\":\"10.1504/ijris.2023.10058359\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":38715,\"journal\":{\"name\":\"International Journal of Reasoning-based Intelligent Systems\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Reasoning-based Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijris.2023.10058359\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Reasoning-based Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijris.2023.10058359","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}