贝尔曼-福特算法

zh

WikiRank.net
ver. 1.6

贝尔曼-福特算法

Quality:

Bellman–Ford algorithm - algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative. Article "贝尔曼-福特算法" in Chinese Wikipedia has 28.2 points for quality (as of November 1, 2023). The article contains 1 references and 12 sections.

This article has the best quality in English Wikipedia. Also, this article is the most popular in that language version.

Since the creation of article "贝尔曼-福特算法", its content was written by 43 registered users of Chinese Wikipedia and edited by 750 registered Wikipedia users in all languages.

The article is cited 83 times in Chinese Wikipedia and cited 857 times in all languages.

The highest Authors Interest rank from 2001:

  • Local (Chinese): #2724 in September 2011
  • Global: #11631 in November 2011

The highest popularity rank from 2008:

  • Local (Chinese): #12568 in November 2008
  • Global: #31688 in April 2015

There are 27 language versions for this article in the WikiRank database (of the considered 55 Wikipedia language editions).

The quality and popularity assessment was based on Wikipédia dumps from November 1, 2023 (including revision history and pageviews for previous years).

下表顯示了最高品質的文章的語言版本。

Languages with the highest quality

#LanguageQuality gradeQuality score
1English (en)
Bellman–Ford algorithm
29.2472
2Chinese (zh)
贝尔曼-福特算法
28.2193
3Hindi (hi)
बेलमैन-फोर्ड एल्गोरिथ्म
24.0984
4Vietnamese (vi)
Thuật toán Bellman–Ford
23.6249
5French (fr)
Algorithme de Bellman-Ford
22.7187
6Italian (it)
Algoritmo di Bellman-Ford
22.4768
7German (de)
Bellman-Ford-Algorithmus
21.8772
8Polish (pl)
Algorytm Bellmana-Forda
21.739
9Hungarian (hu)
Bellman–Ford-algoritmus
20.6522
10Serbian (sr)
Белман-Фордов алгоритам
20.374
More...

The following table shows the most popular language versions of the article.

Most popular in all the time

The most popular language versions of the article "贝尔曼-福特算法" in all the time
#LanguagePopularity awardRelative popularity
1English (en)
Bellman–Ford algorithm
3 502 093
2Russian (ru)
Алгоритм Беллмана — Форда
425 671
3German (de)
Bellman-Ford-Algorithmus
346 889
4French (fr)
Algorithme de Bellman-Ford
306 566
5Spanish (es)
Algoritmo de Bellman-Ford
231 459
6Chinese (zh)
贝尔曼-福特算法
219 720
7Polish (pl)
Algorytm Bellmana-Forda
187 938
8Italian (it)
Algoritmo di Bellman-Ford
128 308
9Japanese (ja)
ベルマン–フォード法
125 606
10Vietnamese (vi)
Thuật toán Bellman–Ford
103 592
More...

The following table shows the language versions of the article with the highest popularity in the last month.

Most popular in October 2023

The most popular language versions of the article "贝尔曼-福特算法" in October 2023
#LanguagePopularity awardRelative popularity
1English (en)
Bellman–Ford algorithm
13 835
2Russian (ru)
Алгоритм Беллмана — Форда
1 730
3French (fr)
Algorithme de Bellman-Ford
1 642
4Chinese (zh)
贝尔曼-福特算法
968
5Spanish (es)
Algoritmo de Bellman-Ford
863
6German (de)
Bellman-Ford-Algorithmus
816
7Vietnamese (vi)
Thuật toán Bellman–Ford
745
8Japanese (ja)
ベルマン–フォード法
545
9Polish (pl)
Algorytm Bellmana-Forda
416
10Italian (it)
Algoritmo di Bellman-Ford
413
More...

The following table shows the language versions of the article with the highest Authors’ Interest.

The highest AI

Language versions of the article "贝尔曼-福特算法" with the highest Authors Interest (number of authors). Only registered Wikipedia users were taken into account.
#LanguageAI awardRelative AI
1English (en)
Bellman–Ford algorithm
191
2German (de)
Bellman-Ford-Algorithmus
81
3French (fr)
Algorithme de Bellman-Ford
75
4Russian (ru)
Алгоритм Беллмана — Форда
45
5Chinese (zh)
贝尔曼-福特算法
43
6Italian (it)
Algoritmo di Bellman-Ford
41
7Vietnamese (vi)
Thuật toán Bellman–Ford
39
8Hebrew (he)
אלגוריתם בלמן-פורד
25
9Persian (fa)
الگوریتم بلمن–فورد
23
10Spanish (es)
Algoritmo de Bellman-Ford
22
More...

The following table shows the language versions of the article with the highest Authors’ Interest in the last month.

The highest AI in October 2023

Language versions of the article "贝尔曼-福特算法" with the highest AI in October 2023
#LanguageAI awardRelative AI
1English (en)
Bellman–Ford algorithm
1
2Dutch (nl)
Algoritme van Bellman-Ford
1
3Portuguese (pt)
Algoritmo de Bellman-Ford
1
4Arabic (ar)
خوارزمية بلمان فورد
0
5Bulgarian (bg)
Алгоритъм на Белман-Форд
0
6Catalan (ca)
Algorisme de Bellman-Ford
0
7Czech (cs)
Bellmanův–Fordův algoritmus
0
8German (de)
Bellman-Ford-Algorithmus
0
9Spanish (es)
Algoritmo de Bellman-Ford
0
10Persian (fa)
الگوریتم بلمن–فورد
0
More...

The following table shows the language versions of the article with the highest number of citations.

The highest CI

Language versions of the article "贝尔曼-福特算法" with the highest Citation Index (CI)
#LanguageCI awardRelative CI
1English (en)
Bellman–Ford algorithm
197
2Japanese (ja)
ベルマン–フォード法
117
3Polish (pl)
Algorytm Bellmana-Forda
112
4Chinese (zh)
贝尔曼-福特算法
83
5Persian (fa)
الگوریتم بلمن–فورد
56
6Russian (ru)
Алгоритм Беллмана — Форда
49
7Ukrainian (uk)
Алгоритм Беллмана — Форда
32
8Italian (it)
Algoritmo di Bellman-Ford
25
9Arabic (ar)
خوارزمية بلمان فورد
24
10German (de)
Bellman-Ford-Algorithmus
23
More...

Scores

Estimated value for Wikipedia:
Chinese:
Global:
Popularity in October 2023:
Chinese:
Global:
Popularity in all years:
Chinese:
Global:
Authors in October 2023:
Chinese:
Global:
Registered authors in all years:
Chinese:
Global:
Citations:
Chinese:
Global:

Quality measures

Interwikis

#LanguageValue
arArabic
خوارزمية بلمان فورد
bgBulgarian
Алгоритъм на Белман-Форд
caCatalan
Algorisme de Bellman-Ford
csCzech
Bellmanův–Fordův algoritmus
deGerman
Bellman-Ford-Algorithmus
enEnglish
Bellman–Ford algorithm
esSpanish
Algoritmo de Bellman-Ford
faPersian
الگوریتم بلمن–فورد
frFrench
Algorithme de Bellman-Ford
heHebrew
אלגוריתם בלמן-פורד
hiHindi
बेलमैन-फोर्ड एल्गोरिथ्म
huHungarian
Bellman–Ford-algoritmus
idIndonesian
Algoritma Bellman–Ford
itItalian
Algoritmo di Bellman-Ford
jaJapanese
ベルマン–フォード法
kaGeorgian
ბელმან-ფორდის ალგორითმი
koKorean
벨먼-포드 알고리즘
nlDutch
Algoritme van Bellman-Ford
plPolish
Algorytm Bellmana-Forda
ptPortuguese
Algoritmo de Bellman-Ford
ruRussian
Алгоритм Беллмана — Форда
simpleSimple English
Bellman–Ford algorithm
srSerbian
Белман-Фордов алгоритам
thThai
ขั้นตอนวิธีของเบลแมน-ฟอร์ด
ukUkrainian
Алгоритм Беллмана — Форда
viVietnamese
Thuật toán Bellman–Ford
zhChinese
贝尔曼-福特算法

Popularity rank trends

Best Rank Chinese:
#12568
11.2008
Global:
#31688
04.2015

AI rank trends

Best Rank Chinese:
#2724
09.2011
Global:
#11631
11.2011

Local AI rank history

Languages comparison

Important global interconnections

Wikipedia readers most often find their way to information on Bellman–Ford algorithm from Wikipedia articles about Shortest path problem, Dijkstras algorithm, Distance-vector routing protocol, Dynamic programming and Johnsons algorithm. Whereas reading the article about Bellman–Ford algorithm people most often go to Wikipedia articles on Dijkstras algorithm, Richard E. Bellman, L. R. Ford, Jr., Floyd–Warshall algorithm and Shortest path problem.

Cumulative results of quality and popularity of the Wikipedia article

List of Wikipedia articles in different languages (starting with the most popular):

News from 14 April 2024

On 14 April 2024 in multilingual Wikipedia, Internet users most often read articles on the following topics: Iran, Bayer 04 Leverkusen, Israel, Fallout, Iron Dome, Xabi Alonso, Max Holloway, Fallout, YouTube, Bundesliga.

In Chinese Wikipedia the most popular articles on that day were: 第42屆香港電影金像獎, 淚之女王, 余香凝, 毛泽东, DAY6, 白日之下, 不夠善良的我們, 姜大衞, 伊朗, 周處除三害 (電影).

About WikiRank

The WikiRank project is intended for automatic relative evaluation of the articles in the various language versions of Wikipedia. At the moment the service allows to compare over 44 million Wikipedia articles in 55 languages. Quality scores of articles are based on Wikipedia dumps from November, 2023. When calculating current popularity and AI of articles data from October 2023 was taken into account. For historical values of popularity and AI WikiRank used data from 2001 to 2023... More information