Talk:Stoer–Wagner algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Add topic

Revision as of 04:12, 21 October 2016 edit SineBot (talk \| contribs) Bots 2,564,818 edits m Signing comment by TheZuza777 - "" ← Previous edit		Latest revision as of 09:29, 29 July 2024 edit undo Supyovalk (talk \| contribs) Extended confirmed users 16,874 edits Assessment: banner shell, Mathematics (Rater)
(5 intermediate revisions by 5 users not shown)
Line 1: {{WikiProject banner shell\|class=C\|1= {{WikiProject Mathematics}} }} This article contains two sample implementations. The first one is C++, contains a reference, and appears to work. Line 18 ⟶ 21: "So, in a single phase, a pair of vertices s and t , and a min s-t cut C is determined" <!-- Template:Unsigned --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:TheZuza777\|TheZuza777]] ([[User talk:TheZuza777#top\|talk]] • [[Special:Contributions/TheZuza777\|contribs]]) 04:12, 21 October 2016 (UTC)</small> <!--Autosigned by SineBot--> == Missing example == There's an example given in the text that seems to refer to a figure that no longer exists. It looks like there was a file called Stoer-wagner_algorithm.png that has been removed. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/12.221.141.99\|12.221.141.99]] ([[User talk:12.221.141.99#top\|talk]]) 17:33, 11 June 2019 (UTC)</small> <!--Autosigned by SineBot--> The example refers to the figures in the original paper; I added a reference to that but perhaps the whole section should be reworked / removed. [[User:Chinasaur\|Chinasaur]] ([[User talk:Chinasaur\|talk]]) 19:33, 17 September 2019 (UTC)