D. Akmaykin, Svetlana F. Klyueva, O. Bukin, P. Salyuk
{"title":"优化最短路径的搜索算法","authors":"D. Akmaykin, Svetlana F. Klyueva, O. Bukin, P. Salyuk","doi":"10.1109/SCP.2015.7342207","DOIUrl":null,"url":null,"abstract":"The exact and heuristic algorithms of search of the shortest routes on the graph are analyzed in the article. The realization of Floyd-Warshall algorithm of search for the shortest routes is shown. The description and realization of the author's heuristic algorithm of search for the shortest route for two chosen vertexes of graph for the given heuristic estimated function is given.","PeriodicalId":110366,"journal":{"name":"2015 International Conference \"Stability and Control Processes\" in Memory of V.I. Zubov (SCP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimization of the search algorithm for the shortest route\",\"authors\":\"D. Akmaykin, Svetlana F. Klyueva, O. Bukin, P. Salyuk\",\"doi\":\"10.1109/SCP.2015.7342207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The exact and heuristic algorithms of search of the shortest routes on the graph are analyzed in the article. The realization of Floyd-Warshall algorithm of search for the shortest routes is shown. The description and realization of the author's heuristic algorithm of search for the shortest route for two chosen vertexes of graph for the given heuristic estimated function is given.\",\"PeriodicalId\":110366,\"journal\":{\"name\":\"2015 International Conference \\\"Stability and Control Processes\\\" in Memory of V.I. Zubov (SCP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference \\\"Stability and Control Processes\\\" in Memory of V.I. Zubov (SCP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCP.2015.7342207\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference \"Stability and Control Processes\" in Memory of V.I. Zubov (SCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCP.2015.7342207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimization of the search algorithm for the shortest route
The exact and heuristic algorithms of search of the shortest routes on the graph are analyzed in the article. The realization of Floyd-Warshall algorithm of search for the shortest routes is shown. The description and realization of the author's heuristic algorithm of search for the shortest route for two chosen vertexes of graph for the given heuristic estimated function is given.