problèmes de cheminement
Sign in to saveAlso known as single-pair shortest path problem
problèmes classiques mathématiques de la théorie des graphes
In the Vinony graph
Within Vinony's link graph, problèmes de cheminement is referenced by 331 other articles, and connects out to Dijkstra's algorithm, A* search algorithm and Bellman–Ford algorithm.
Vinony files it under Computational problems in graph theory, Edsger W. Dijkstra and Graph distance.
Its subject is documented across 24 Wikipedia language editions.
Wikidata facts
- Instance of
- computational problem
- Image
- Shortest path with direct weights.svg
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0
Article · Français
En théorie des graphes, le problème de plus court chemin est le problème algorithmique qui consiste à trouver un chemin d'un sommet à un autre de façon que la somme des poids des arcs de ce chemin soit minimale.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
Dijkstra's algorithm
Entity
A* search algorithm
Entity
Bellman–Ford algorithm
Entity
transport
Entity
International Standard Book Number
Entity
function
Entity
computer network
Entity
Rubik's Cube
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Google Maps
Entity
robotics
Entity
sequence
Entity
Edsger W. Dijkstra
Entity
graph theory
Entity
OCLC, Inc.
Entity
Institute of Electrical and Electronics Engineers
Entity
graph
Entity
bibcode
Entity
arXiv
Entity