See algorithme de Dijkstra in All languages combined, or Wiktionary
{ "categories": [ { "kind": "other", "name": "Compositions en français", "parents": [], "source": "w" }, { "kind": "other", "name": "Locutions nominales en français", "parents": [], "source": "w" }, { "kind": "other", "name": "Mots en français se référant à une personne", "parents": [], "source": "w" }, { "kind": "other", "name": "Traductions en anglais", "parents": [], "source": "w" }, { "kind": "other", "name": "Traductions en espagnol", "parents": [], "source": "w" }, { "kind": "other", "name": "Français", "orig": "français", "parents": [], "source": "w" } ], "etymology_texts": [ "Composé de algorithme et de Dijkstra, du nom de son inventeur." ], "lang": "Français", "lang_code": "fr", "pos": "noun", "pos_title": "Locution nominale", "senses": [ { "categories": [ { "kind": "other", "name": "Lexique en français de la théorie des graphes", "parents": [], "source": "w" } ], "glosses": [ "Algorithme qui permet de trouver des plus courts chemins, depuis un sommet source donné, dans un graphe orienté pondéré." ], "id": "fr-algorithme_de_Dijkstra-fr-noun--fy4EJTH", "raw_tags": [ "Théorie des graphes" ] } ], "sounds": [ { "ipa": "\\al.ɡo.ʁitm də diʒk.stʁa\\" }, { "ipa": "\\al.ɡo.ʁitm də dɛjk.stʁa\\" }, { "audio": "LL-Q150 (fra)-Lepticed7-algorithme de Dijkstra.wav", "ipa": "al̪.ɡo.ʁit̪.mə d̪ø d̪ɛjk.st̪ʁ̥a", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/d/d4/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/d/d4/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav.ogg", "raw_tags": [ "France (Toulouse)" ], "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-algorithme de Dijkstra.wav" }, { "audio": "LL-Q150 (fra)-WikiLucas00-algorithme de Dijkstra.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/48/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/48/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav.ogg", "raw_tags": [ "Lyon (France)" ], "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-WikiLucas00-algorithme de Dijkstra.wav" } ], "tags": [ "masculine" ], "translations": [ { "lang": "Anglais", "lang_code": "en", "word": "Dijkstra’s algorithm" }, { "lang": "Espagnol", "lang_code": "es", "tags": [ "masculine" ], "word": "algoritmo de Dijkstra" } ], "word": "algorithme de Dijkstra" }
{ "categories": [ "Compositions en français", "Locutions nominales en français", "Mots en français se référant à une personne", "Traductions en anglais", "Traductions en espagnol", "français" ], "etymology_texts": [ "Composé de algorithme et de Dijkstra, du nom de son inventeur." ], "lang": "Français", "lang_code": "fr", "pos": "noun", "pos_title": "Locution nominale", "senses": [ { "categories": [ "Lexique en français de la théorie des graphes" ], "glosses": [ "Algorithme qui permet de trouver des plus courts chemins, depuis un sommet source donné, dans un graphe orienté pondéré." ], "raw_tags": [ "Théorie des graphes" ] } ], "sounds": [ { "ipa": "\\al.ɡo.ʁitm də diʒk.stʁa\\" }, { "ipa": "\\al.ɡo.ʁitm də dɛjk.stʁa\\" }, { "audio": "LL-Q150 (fra)-Lepticed7-algorithme de Dijkstra.wav", "ipa": "al̪.ɡo.ʁit̪.mə d̪ø d̪ɛjk.st̪ʁ̥a", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/d/d4/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/d/d4/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-Lepticed7-algorithme_de_Dijkstra.wav.ogg", "raw_tags": [ "France (Toulouse)" ], "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-algorithme de Dijkstra.wav" }, { "audio": "LL-Q150 (fra)-WikiLucas00-algorithme de Dijkstra.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/48/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/48/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav/LL-Q150_(fra)-WikiLucas00-algorithme_de_Dijkstra.wav.ogg", "raw_tags": [ "Lyon (France)" ], "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-WikiLucas00-algorithme de Dijkstra.wav" } ], "tags": [ "masculine" ], "translations": [ { "lang": "Anglais", "lang_code": "en", "word": "Dijkstra’s algorithm" }, { "lang": "Espagnol", "lang_code": "es", "tags": [ "masculine" ], "word": "algoritmo de Dijkstra" } ], "word": "algorithme de Dijkstra" }
Download raw JSONL data for algorithme de Dijkstra meaning in Français (2.2kB)
This page is a part of the kaikki.org machine-readable Français dictionary. This dictionary is based on structured data extracted on 2025-05-18 from the frwiktionary dump dated 2025-05-01 using wiktextract (c3cc510 and 1d3fdbf). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.