About: Bellman–Ford algorithm

Property	Value
dbo:description	calcul des plus courts chemins depuis un sommet source donné dans un graphe orienté pondéré (fr) algoritmi lyhimmän polun etsimiseen graafissa, jossa on kaarella voi olla negatiivinen paino (fi) Handlungsvorschrift aus der Graphentheorie (de) خوارزمية لإيجاد أقصر مسار من عقدة محددة نحو كل عقد بيان (ar) algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative (en) algoritmo per trovare in un grafo con pesi negativi il percorso più breve da una sorgente singola (it) алгоритм поиска кратчайшего расстояния от данной вершины до всех остальных во взвешенном графе (ru)
dbo:thumbnail	wiki-commons:Special:FilePath/Bellman–Ford_algorithm_example.gif?width=300
dbo:wikiPageExternalLink	http://safari.oreilly.com/0201361213/ch21lev1sec7%7Caccess-date=2007-05-28%7Carchive-url=https:/web.archive.org/web/20080531142256/http:/safari.oreilly.com/0201361213/ch21lev1sec7%7Carchive-date=2008-05-31%7Curl-status=dead http://www.cs.rhul.ac.uk/books/dbook/ http://homepages.cwi.nl/~lex/files/histco.pdf http://www.rand.org/pubs/papers/P923.html
dbo:wikiPageWikiLink	dbc:Polynomial-time_problems dbc:Graph_distance dbr:Network_topology dbc:Dynamic_programming dbr:Cycle_(graph_theory) dbr:Relaxation_(approximation) dbr:Minimum-cost_flow_problem dbc:Graph_algorithms dbr:Priority_queue dbr:Expected_value dbr:O'Reilly_Media dbr:Big_O_notation dbr:Walk_(graph_theory) dbc:Articles_with_example_C_code dbc:Articles_with_example_pseudocode dbr:Flow_network dbr:L._R._Ford_Jr. dbr:Vertex_(graph_theory) dbr:Algorithm dbr:Dijkstra's_algorithm dbr:Mathematical_induction dbr:Greedy_algorithm dbr:Dense_graph dbr:Edward_F._Moore dbr:Routing_Information_Protocol dbr:Shortest_Path_Faster_Algorithm dbr:Autonomous_system_(Internet) dbr:Single-source_shortest_path_problem dbr:Distance-vector_routing_protocol dbr:Random_permutation dbr:Cycle_detection dbr:Graph_(data_structure) dbr:Richard_Bellman dbr:Shortest_path dbr:Weighted_digraph dbr:File:Bellman-Ford_worst-case_example.svg
dbp:class	dbr:Shortest_path_problem
dbp:data	dbr:Graph_(abstract_data_type)
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:! dbt:Reflist dbt:Math dbt:Cite_journal dbt:Cite_conference dbt:Introduction_to_Algorithms dbt:ISBN dbt:Sfnp dbt:Mvar dbt:Abs dbt:Harvid dbt:Harvs dbt:Harvtxt dbt:Infobox_Algorithm dbt:Graph_traversal_algorithms dbt:Short_description
dct:subject	dbc:Polynomial-time_problems dbc:Graph_distance dbc:Dynamic_programming dbc:Graph_algorithms dbc:Articles_with_example_C_code dbc:Articles_with_example_pseudocode
rdfs:label	Bellman–Ford algorithm (en) خوارزمية بلمان فورد (ar) Algorisme de Bellman-Ford (ca) Bellmanův–Fordův algoritmus (cs) Bellman-Ford-Algorithmus (de) Algoritmo de Bellman-Ford (es) Algoritma Bellman–Ford (in) Algorithme de Bellman-Ford (fr) Algoritmo di Bellman-Ford (it) ベルマン–フォード法 (ja) Algoritme van Bellman-Ford (nl) 벨먼-포드 알고리즘 (ko) Algorytm Bellmana-Forda (pl) Algoritmo de Bellman-Ford (pt) Алгоритм Беллмана — Форда (ru) Алгоритм Беллмана — Форда (uk) 贝尔曼-福特算法 (zh)
owl:sameAs	freebase:Bellman–Ford algorithm wikidata:Bellman–Ford algorithm dbpedia-it:Bellman–Ford algorithm dbpedia-nl:Bellman–Ford algorithm dbpedia-de:Bellman–Ford algorithm dbpedia-fr:Bellman–Ford algorithm dbpedia-zh:Bellman–Ford algorithm dbpedia-ja:Bellman–Ford algorithm dbpedia-pt:Bellman–Ford algorithm dbpedia-he:Bellman–Ford algorithm dbpedia-es:Bellman–Ford algorithm dbpedia-hu:Bellman–Ford algorithm dbpedia-fa:Bellman–Ford algorithm dbpedia-ru:Bellman–Ford algorithm dbpedia-vi:Bellman–Ford algorithm dbpedia-pl:Bellman–Ford algorithm dbpedia-ko:Bellman–Ford algorithm dbpedia-id:Bellman–Ford algorithm dbpedia-ca:Bellman–Ford algorithm dbpedia-ar:Bellman–Ford algorithm dbpedia-bg:Bellman–Ford algorithm dbpedia-cs:Bellman–Ford algorithm dbpedia-hi:Bellman–Ford algorithm dbpedia-ka:Bellman–Ford algorithm dbpedia-lv:Bellman–Ford algorithm dbpedia-mk:Bellman–Ford algorithm dbpedia-simple:Bellman–Ford algorithm dbpedia-sr:Bellman–Ford algorithm dbpedia-th:Bellman–Ford algorithm dbpedia-uk:Bellman–Ford algorithm dbpedia-global:Bellman–Ford algorithm dbr:Bellman–Ford algorithm
prov:wasDerivedFrom	wikipedia-en:Bellman–Ford_algorithm?oldid=1291957379&ns=0
foaf:depiction	wiki-commons:Special:FilePath/Bellman-Ford_worst-case_example.svg wiki-commons:Special:FilePath/Bellman–Ford_algorithm_example.gif
foaf:isPrimaryTopicOf	wikipedia-en:Bellman–Ford_algorithm
is dbo:knownFor of	dbr:Richard_E._Bellman
is dbo:wikiPageDisambiguates of	dbr:Bellman
is dbo:wikiPageRedirects of	dbr:Bellman-Ford dbr:Bellman-Ford-Moore dbr:Bellman-Ford-Moore_algorithm dbr:Bellman-Ford_Algorithm dbr:Bellman-Ford_algorithm dbr:Bellman-Shimbel dbr:Bellman-Shimbel_algorithm dbr:Bellman-ford dbr:Bellman_Ford dbr:Bellman_Ford_Algorithm dbr:Bellman_Ford_Moore dbr:Bellman_Ford_Moore_algorithm dbr:Bellman_Ford_algorithm dbr:Bellman_Shimbel dbr:Bellman_Shimbel_algorithm dbr:Bellman–Ford dbr:Bellman–Ford–Moore dbr:Bellman–Ford–Moore_algorithm dbr:Bellman–Shimbel dbr:Bellman–Shimbel_algorithm dbr:Belman-Ford dbr:Belman-Ford_algorithm dbr:Shimbel's_algorithm dbr:Ford-Bellman
is dbo:wikiPageWikiLink of	dbr:List_of_examples_of_Stigler's_law dbr:Network_Time_Protocol dbr:Pathfinding dbr:Routing dbr:List_of_terms_relating_to_algorithms_and_data_structures dbr:Parsing_expression_grammar dbr:Matching_(graph_theory) dbr:Shortest_path_problem dbr:Fast_marching_method dbr:Timeline_of_algorithms dbr:Path_(graph_theory) dbr:August_1920 dbr:Directed_acyclic_graph dbr:L._R._Ford_Jr. dbr:Eikonal_equation dbr:Johnson's_algorithm dbr:Destination-Sequenced_Distance_Vector_routing dbr:Dijkstra's_algorithm dbr:Graph_theory dbr:Bellman dbr:Diffusing_update_algorithm dbr:Routing_Information_Protocol dbr:Shortest_Path_Faster_Algorithm dbr:Richard_E._Bellman dbr:BF dbr:Path-vector_routing_protocol dbr:List_of_graph_theory_topics dbr:List_of_mathematical_proofs dbr:Yen's_algorithm dbr:List_of_algorithms dbr:K_shortest_path_routing dbr:Dynamic_programming dbr:Fractional_Pareto_efficiency dbr:Biological_network_inference dbr:Distance-vector_routing_protocol dbr:Shortest-path_tree dbr:Zero-weight_cycle_problem dbr:Heuristic_routing dbr:Parallel_single-source_shortest_path_algorithm dbr:Wireless_Routing_Protocol dbr:Rental_harmony dbr:Bellman-Ford dbr:Bellman-Ford-Moore dbr:Bellman-Ford-Moore_algorithm dbr:Bellman-Ford_Algorithm dbr:Bellman-Ford_algorithm dbr:Bellman-Shimbel dbr:Bellman-Shimbel_algorithm dbr:Bellman-ford dbr:Bellman_Ford dbr:Bellman_Ford_Algorithm dbr:Bellman_Ford_Moore dbr:Bellman_Ford_Moore_algorithm dbr:Bellman_Ford_algorithm dbr:Bellman_Shimbel dbr:Bellman_Shimbel_algorithm dbr:Bellman–Ford dbr:Bellman–Ford–Moore dbr:Bellman–Ford–Moore_algorithm dbr:Bellman–Shimbel dbr:Bellman–Shimbel_algorithm dbr:Belman-Ford dbr:Belman-Ford_algorithm dbr:Shimbel's_algorithm dbr:Ford-Bellman
is dbp:knownFor of	dbr:Richard_E._Bellman
is foaf:primaryTopic of	wikipedia-en:Bellman–Ford_algorithm