Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Floyd–Warshall_algorithm> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Floyd–Warshall_algorithm abstract "In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles, see below) and also for finding transitive closure of a relation . A single execution of the algorithm will find the lengths (summed weights) of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves.The Floyd–Warshall algorithm was published in its currently recognized form by Robert Floyd in 1962. However, it is essentially the same as algorithms previously published by Bernard Roy in 1959 and also by Stephen Warshall in 1962 for finding the transitive closure of a graph. The modern formulation of Warshall's algorithm as three nested for-loops was first described by Peter Ingerman, also in 1962.The algorithm is an example of dynamic programming.".
- Floyd–Warshall_algorithm thumbnail Floyd-Warshall_example.svg?width=300.
- Floyd–Warshall_algorithm wikiPageID "230401".
- Floyd–Warshall_algorithm wikiPageRevisionID "605662493".
- Floyd–Warshall_algorithm class Shortest_path_problem.
- Floyd–Warshall_algorithm data Graph_(abstract_data_type).
- Floyd–Warshall_algorithm subject Category:Articles_with_example_pseudocode.
- Floyd–Warshall_algorithm subject Category:Dynamic_programming.
- Floyd–Warshall_algorithm subject Category:Graph_algorithms.
- Floyd–Warshall_algorithm subject Category:Polynomial-time_problems.
- Floyd–Warshall_algorithm subject Category:Routing_algorithms.
- Floyd–Warshall_algorithm comment "In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles, see below) and also for finding transitive closure of a relation .".
- Floyd–Warshall_algorithm label "Algorithme de Floyd-Warshall".
- Floyd–Warshall_algorithm label "Algorithmus von Floyd und Warshall".
- Floyd–Warshall_algorithm label "Algoritmo de Floyd-Warshall".
- Floyd–Warshall_algorithm label "Algoritmo de Floyd-Warshall".
- Floyd–Warshall_algorithm label "Algoritmo di Floyd-Warshall".
- Floyd–Warshall_algorithm label "Algorytm Floyda-Warshalla".
- Floyd–Warshall_algorithm label "Floyd–Warshall algorithm".
- Floyd–Warshall_algorithm label "Алгоритм Флойда — Уоршелла".
- Floyd–Warshall_algorithm label "ワーシャル-フロイド法".
- Floyd–Warshall_algorithm label "弗洛伊德算法".
- Floyd–Warshall_algorithm sameAs Floyd%E2%80%93Warshall_algorithm.
- Floyd–Warshall_algorithm sameAs Floydův-Warshallův_algoritmus.
- Floyd–Warshall_algorithm sameAs Algorithmus_von_Floyd_und_Warshall.
- Floyd–Warshall_algorithm sameAs Algoritmo_de_Floyd-Warshall.
- Floyd–Warshall_algorithm sameAs Algorithme_de_Floyd-Warshall.
- Floyd–Warshall_algorithm sameAs Algoritma_Floyd-Warshall.
- Floyd–Warshall_algorithm sameAs Algoritmo_di_Floyd-Warshall.
- Floyd–Warshall_algorithm sameAs ワーシャル-フロイド法.
- Floyd–Warshall_algorithm sameAs 플로이드-와셜_알고리즘.
- Floyd–Warshall_algorithm sameAs Algorytm_Floyda-Warshalla.
- Floyd–Warshall_algorithm sameAs Algoritmo_de_Floyd-Warshall.
- Floyd–Warshall_algorithm sameAs Q1047576.
- Floyd–Warshall_algorithm sameAs Q1047576.
- Floyd–Warshall_algorithm wasDerivedFrom Floyd–Warshall_algorithm?oldid=605662493.
- Floyd–Warshall_algorithm depiction Floyd-Warshall_example.svg.
