Talk:Minimum bottleneck spanning tree
Add topicLatest comment: 8 months ago by ~2025-33219-10 in topic mistake in example?
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
mistake in example?
[edit]in the pseudocode for 'Gabow and Tarjan algorithm for MBSA' it is stated that in every iteration the v in F with minimal c(v) is picked, but in the third step of the example ("Next we move to the vertex 4 in the graph G"), 1 is in F and c(1)=1 < 4=c(4) - why is 4 picked before 1? ~2025-33219-10 (talk) 07:15, 13 November 2025 (UTC)