caa a22 4500 60547026X CHVBK 20210128100326.0 cr unu---uuuuu 210128e20150801xx s 000 0 eng 10.1007/s00500-014-1434-2 doi (NATIONALLICENCE)springer-10.1007/s00500-014-1434-2 Computing $$k$$ k shortest paths from a source node to each other node [Elektronische Daten] [Guisong Liu, Zhao Qiu, Hong Qu, Luping Ji, Alexander Takacs] The single-pair K shortest path (KSP) problem can be described as finding $$k$$ k least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ k distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. Springer-Verlag Berlin Heidelberg, 2014 K shortest path problem nationallicence Single-pair KSP nationallicence Single-source KSP nationallicence Liu Guisong Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut Qiu Zhao Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut Qu Hong Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut Ji Luping Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut Takacs Alexander School of Computer Science and Communication, KTH Royal Institute of Technology, 100 44, Stockholm, Sweden aut Soft Computing Springer Berlin Heidelberg 19/8(2015-08-01), 2391-2402 1432-7643 19:8<2391 2015 19 500 https://doi.org/10.1007/s00500-014-1434-2 text/html Onlinezugriff via DOI BK010053 XK010053 XK010000 Metadata rights reserved Springer special CC-BY-NC licence nationallicence 1 research-article jats NATIONALLICENCE NATIONALLICENCE NL-springer NATIONALLICENCE 856 40 https://doi.org/10.1007/s00500-014-1434-2 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Liu Guisong Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut NATIONALLICENCE 700 1- Qiu Zhao Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut NATIONALLICENCE 700 1- Qu Hong Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut NATIONALLICENCE 700 1- Ji Luping Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, People's Republic of China aut NATIONALLICENCE 700 1- Takacs Alexander School of Computer Science and Communication, KTH Royal Institute of Technology, 100 44, Stockholm, Sweden aut NATIONALLICENCE 773 0- Soft Computing Springer Berlin Heidelberg 19/8(2015-08-01), 2391-2402 1432-7643 19:8<2391 2015 19 500