See graphe eulérien on 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": "Traductions en anglais", "parents": [], "source": "w" }, { "kind": "other", "name": "Français", "orig": "français", "parents": [], "source": "w" } ], "etymology_texts": [ "Composé de graphe et de eulérien." ], "forms": [ { "form": "graphes eulériens", "tags": [ "plural" ] } ], "lang": "Français", "lang_code": "fr", "pos": "noun", "pos_title": "Locution nominale", "senses": [ { "categories": [ { "kind": "other", "name": "Exemples en français", "parents": [], "source": "w" }, { "kind": "other", "name": "Lexique en français de la théorie des graphes", "parents": [], "source": "w" } ], "examples": [ { "text": "On peut tracer un graphe eulérien sans lever le crayon." }, { "ref": "Théorème d'Euler, 1736", "text": "Un graphe connexe est eulérien si et seulement si chacun de ses sommets est incident à un nombre pair d'arêtes." } ], "glosses": [ "Graphe orienté possédant au moins un cycle eulérien, c'est-à-dire qui passe par toutes les arêtes une seule fois." ], "id": "fr-graphe_eulérien-fr-noun-HVEaWvhD", "raw_tags": [ "Théorie des graphes" ] } ], "sounds": [ { "ipa": "\\ɡʁa.f‿ø.le.ʁjɛ̃\\" }, { "audio": "LL-Q150 (fra)-Lepticed7-graphe eulérien.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/1/1a/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/1/1a/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav.ogg", "raw_tags": [ "France (Toulouse)" ], "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-graphe eulérien.wav" } ], "tags": [ "masculine" ], "translations": [ { "lang": "Anglais", "lang_code": "en", "word": "Eulerian graph" } ], "word": "graphe eulérien" }
{ "categories": [ "Compositions en français", "Locutions nominales en français", "Traductions en anglais", "français" ], "etymology_texts": [ "Composé de graphe et de eulérien." ], "forms": [ { "form": "graphes eulériens", "tags": [ "plural" ] } ], "lang": "Français", "lang_code": "fr", "pos": "noun", "pos_title": "Locution nominale", "senses": [ { "categories": [ "Exemples en français", "Lexique en français de la théorie des graphes" ], "examples": [ { "text": "On peut tracer un graphe eulérien sans lever le crayon." }, { "ref": "Théorème d'Euler, 1736", "text": "Un graphe connexe est eulérien si et seulement si chacun de ses sommets est incident à un nombre pair d'arêtes." } ], "glosses": [ "Graphe orienté possédant au moins un cycle eulérien, c'est-à-dire qui passe par toutes les arêtes une seule fois." ], "raw_tags": [ "Théorie des graphes" ] } ], "sounds": [ { "ipa": "\\ɡʁa.f‿ø.le.ʁjɛ̃\\" }, { "audio": "LL-Q150 (fra)-Lepticed7-graphe eulérien.wav", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/1/1a/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/1/1a/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav/LL-Q150_(fra)-Lepticed7-graphe_eulérien.wav.ogg", "raw_tags": [ "France (Toulouse)" ], "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-graphe eulérien.wav" } ], "tags": [ "masculine" ], "translations": [ { "lang": "Anglais", "lang_code": "en", "word": "Eulerian graph" } ], "word": "graphe eulérien" }
Download raw JSONL data for graphe eulérien meaning in All languages combined (1.6kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the frwiktionary dump dated 2024-12-20 using wiktextract (d8cb2f3 and 4e554ae). 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.