{
"@context": [
"http://api.conceptnet.io/ld/conceptnet5.7/context.ld.json"
],
"@id": "/c/en/bellman_ford_algorithm/n",
"edges": [
{
"@id": "/a/[/r/RelatedTo/,/c/en/bellman_ford_algorithm/n/,/c/en/algorithm/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/algorithm",
"@type": "Node",
"label": "algorithm",
"language": "en",
"term": "/c/en/algorithm"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/RelatedTo",
"@type": "Relation",
"label": "RelatedTo"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/RelatedTo/,/c/en/bellman_ford_algorithm/n/,/c/en/path/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/path",
"@type": "Node",
"label": "path",
"language": "en",
"term": "/c/en/path"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/RelatedTo",
"@type": "Relation",
"label": "RelatedTo"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/Synonym/,/c/en/bellman_ford_algorithm/n/,/c/pt/algoritmo_de_bellman_ford/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/pt/algoritmo_de_bellman_ford",
"@type": "Node",
"label": "algoritmo de bellman ford",
"language": "pt",
"term": "/c/pt/algoritmo_de_bellman_ford"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/Synonym",
"@type": "Relation",
"label": "Synonym"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/RelatedTo/,/c/en/bellman_ford_algorithm/n/,/c/en/dijkstra's_algorithm/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/dijkstra's_algorithm",
"@type": "Node",
"label": "dijkstra's algorithm",
"language": "en",
"term": "/c/en/dijkstra's_algorithm"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/RelatedTo",
"@type": "Relation",
"label": "RelatedTo"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/RelatedTo/,/c/en/bellman_ford_algorithm/n/,/c/en/digraph/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/digraph",
"@type": "Node",
"label": "digraph",
"language": "en",
"term": "/c/en/digraph"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/RelatedTo",
"@type": "Relation",
"label": "RelatedTo"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/HasContext/,/c/en/bellman_ford_algorithm/n/,/c/en/computing/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/computing",
"@type": "Node",
"label": "computing",
"language": "en",
"term": "/c/en/computing"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/HasContext",
"@type": "Relation",
"label": "HasContext"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/RelatedTo/,/c/en/bellman_ford_algorithm/n/,/c/en/weighted/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/weighted",
"@type": "Node",
"label": "weighted",
"language": "en",
"term": "/c/en/weighted"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/RelatedTo",
"@type": "Relation",
"label": "RelatedTo"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/HasContext/,/c/en/bellman_ford_algorithm/n/,/c/en/graph_theory/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/graph_theory",
"@type": "Node",
"label": "graph theory",
"language": "en",
"term": "/c/en/graph_theory"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/HasContext",
"@type": "Relation",
"label": "HasContext"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
},
{
"@id": "/a/[/r/RelatedTo/,/c/en/bellman_ford_algorithm/n/,/c/en/negative/]",
"@type": "Edge",
"dataset": "/d/wiktionary/en",
"end": {
"@id": "/c/en/negative",
"@type": "Node",
"label": "negative",
"language": "en",
"term": "/c/en/negative"
},
"license": "cc:by-sa/4.0",
"rel": {
"@id": "/r/RelatedTo",
"@type": "Relation",
"label": "RelatedTo"
},
"sources": [
{
"@id": "/and/[/s/process/wikiparsec/2/,/s/resource/wiktionary/en/]",
"@type": "Source",
"contributor": "/s/resource/wiktionary/en",
"process": "/s/process/wikiparsec/2"
}
],
"start": {
"@id": "/c/en/bellman_ford_algorithm/n",
"@type": "Node",
"label": "bellman ford algorithm",
"language": "en",
"sense_label": "n",
"term": "/c/en/bellman_ford_algorithm"
},
"surfaceText": null,
"weight": 1.0
}
],
"version": "5.8.1"
}