Search results
Jump to navigation
Jump to search
- == Known algorithms == # [[Repeated depth-first search]]195 bytes (27 words) - 07:21, 3 November 2014
- === String Matching Algorithms === === Sorting Algorithms ===4 KB (380 words) - 15:13, 30 November 2020
- == Known algorithms == # [[Depth-first search]]2 KB (314 words) - 19:06, 9 November 2014
- [[Category:Graph Algorithms]] # Apply a [[repeated depth-first search]] to <math>G</math>, the output order is parenthetical.4 KB (789 words) - 07:37, 2 November 2015
- [[Category:Graph Algorithms]] # The core algorithm is a variation of [[Depth-first search|DFS]], where for each node <math>v\in V</math> two additional nonnegative i6 KB (1,028 words) - 13:31, 3 November 2015
- [[Category:Algorithms]] [[Category:Search Algorithms]]6 KB (959 words) - 13:41, 3 March 2017
- [[Category:Algorithms]] [[Category:Search Algorithms]]7 KB (1,165 words) - 07:50, 26 October 2015
- [[Category:Graph Algorithms]] ...e:Dijkstrabidirectional.png|350px|thumb|right|advantage of a bidirectional search]]10 KB (1,765 words) - 08:35, 14 January 2021
- # Run a modified [[Breadth-first search|BFS]] from <math>v_0</math>, where for every processed arc <math>(v,w)\in A ...l#Remarks|graph traversal]]: It is reasonable to implement graph-traversal algorithms as iterators. In fact, then the modification may be simply added to the loo4 KB (788 words) - 11:27, 16 March 2017
- == Iterative and recursive algorithms == ...thus executed strictly after each other), it may be viewed as two or more algorithms that are executed after each other. Therefore, without loss of generality,12 KB (1,782 words) - 12:49, 28 April 2016
- [[Category:Algorithms]] [[Category:Search Algorithms]]11 KB (1,966 words) - 06:52, 26 October 2015