| dbo:description
|
- алгоритм нахождения кратчайшего расстояния между парами вершин (ru)
- algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest (en)
- algoritmo pri grafoj (eo)
- algoritem za iskanje najkrajših poti med vsemi pari točk v redkem povezavno (po možnosti negativno) uteženem usmerjenem grafu; za odstranitev negativnih uteži uporablja Bellmanov-Fordov algoritem, za preostale pa Dijkstrov algoritem (sl)
|
| dbo:thumbnail
| |
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageWikiLink
| |
| dbp:class
| |
| dbp:data
| |
| dbp:wikiPageUsesTemplate
| |
| dct:subject
| |
| rdf:type
| |
| rdfs:label
|
- Johnson's algorithm (en)
- Johnsonův algoritmus (cs)
- Algoritmo de Johnson (es)
- Algorithme de Johnson (fr)
- Algoritmo de Johnson (pt)
- Algorytm Johnsona (pl)
- Алгоритм Джонсона (ru)
- Алгоритм Джонсона (uk)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:depiction
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is dbp:notableWorks
of | |
| is foaf:primaryTopic
of | |
