Ndist2vec: Node with Landmark and New Distance to Vector Method for Predicting Shortest Path Distance along Road Networks

The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd–Warshall, cannot be extended to large-scale road ne...

Full beskrivning

Bibliografiska uppgifter

Huvudupphov:	Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang, Yang Zhong
Materialtyp:	Artigo
Språk:	Inglês
Utgiven:	MDPI AG 2022-10-01
Serie:	ISPRS International Journal of Geo-Information
Ämnen:	road networks shortest path distance landmarks graph embedding neural networks
Länkar:	https://www.mdpi.com/2220-9964/11/10/514
Taggar:	Lägg till en tagg Inga taggar, Lägg till första taggen!