A Contribution of Shortest Paths Algorithms to the NetworkX Python Library

A Contribution of Shortest Paths Algorithms to the NetworkX Python Library

NetworkX is a free Python library for graphs and networks and is used in many applications and projects to find the shortest path in path planning scenarios. For dense graphs, the library provides the Floyd–Warshall algorithm for shortest paths and the A* (“A-Star”) algorithm for shortest paths and...

Full description

Saved in:
Bibliographic Details
Main Authors: Miguel Cruz, Rui Carvalho, André Costa, Luis Pinto, Luis Dias, Paulino Cerqueira, Rodrigo Machado, Tiago Batista, Pedro Castro, Jorge Ribeiro
Format: Article
Language:English
Published: MDPI AG 2025-07-01
Series:Applied Sciences
Subjects:
shortest path
NetworkX
A-Star
IDA*
D* Lite
SMA*
Online Access:https://www.mdpi.com/2076-3417/15/15/8273
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2076-3417/15/15/8273

Similar Items