See Bellman-Ford algorithm in All languages combined, or Wiktionary
{
"etymology_text": "Named after its developers, Richard Bellman and L. R. Ford, Jr.",
"forms": [
{
"form": "Bellman-Ford algorithms",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Bellman-Ford algorithm (plural Bellman-Ford algorithms)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Portuguese translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computing",
"orig": "en:Computing",
"parents": [
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights."
],
"id": "en-Bellman-Ford_algorithm-en-noun-6Pd5m04P",
"links": [
[
"graph theory",
"graph theory"
],
[
"computing",
"computing#Noun"
],
[
"algorithm",
"algorithm"
],
[
"path",
"path"
],
[
"weighted",
"weighted"
],
[
"digraph",
"digraph"
],
[
"Dijkstra's algorithm",
"Dijkstra's algorithm"
],
[
"negative",
"negative"
]
],
"raw_glosses": [
"(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights."
],
"topics": [
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "pt",
"lang": "Portuguese",
"sense": "shortest-path algorithm",
"tags": [
"masculine"
],
"word": "algoritmo de Bellman-Ford"
}
],
"wikipedia": [
"Bellman-Ford algorithm",
"L. R. Ford, Jr.",
"Richard Bellman"
]
}
],
"word": "Bellman-Ford algorithm"
}
{
"etymology_text": "Named after its developers, Richard Bellman and L. R. Ford, Jr.",
"forms": [
{
"form": "Bellman-Ford algorithms",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Bellman-Ford algorithm (plural Bellman-Ford algorithms)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Portuguese translations",
"en:Computing",
"en:Graph theory"
],
"glosses": [
"An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"computing",
"computing#Noun"
],
[
"algorithm",
"algorithm"
],
[
"path",
"path"
],
[
"weighted",
"weighted"
],
[
"digraph",
"digraph"
],
[
"Dijkstra's algorithm",
"Dijkstra's algorithm"
],
[
"negative",
"negative"
]
],
"raw_glosses": [
"(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights."
],
"topics": [
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Bellman-Ford algorithm",
"L. R. Ford, Jr.",
"Richard Bellman"
]
}
],
"translations": [
{
"code": "pt",
"lang": "Portuguese",
"sense": "shortest-path algorithm",
"tags": [
"masculine"
],
"word": "algoritmo de Bellman-Ford"
}
],
"word": "Bellman-Ford algorithm"
}
Download raw JSONL data for Bellman-Ford algorithm meaning in English (1.7kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.