Search results
Jump to navigation
Jump to search
Page title matches
- '''Type of algorithm:''' loop. # The algorithm is named after three indian researchers, V. M. Malhotra, M. Pramodh Kumar,4 KB (788 words) - 11:27, 16 March 2017
- [[Category:Algorithm]] '''Type of algorithm:''' loop1 KB (190 words) - 13:38, 27 January 2015
- [[Category:Algorithm]] [[Category:Main Algorithm]]4 KB (707 words) - 10:13, 21 September 2015
- ''' Type of algorithm:''' recursion with an arbitrarily chosen start node <math>s\in V</math> as # If <math>x\neq s</math>, terminate the algorithm with the statement that no eulerian cycle exists.4 KB (673 words) - 08:15, 2 November 2015
Page text matches
- '''Type of algorithm:''' loop ==Description of the algorithm==735 bytes (107 words) - 11:22, 13 October 2014
- [[Category:Algorithm]] '''Type of algorithm:''' loop1 KB (190 words) - 13:38, 27 January 2015
- '''Type of algorithm:''' loop == Description of the algorithm ==835 bytes (136 words) - 11:21, 13 October 2014
- # Roughly speaking, the run time of an algorithm is measured by the number of [[Algorithms and correctness#Instructions, ope ...arded. For that, it does not matter how fast the machine and how smart the algorithm's implementation is.4 KB (700 words) - 05:54, 25 April 2016
- [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]2 KB (290 words) - 12:14, 18 September 2015
- '''Type of algorithm:''' loop ...ise, if the key to be removed is in the first array, it is removed and the algorithm terminates again (if this was the only element of the array, that array lis5 KB (808 words) - 23:11, 19 June 2015
- [[Category:Algorithm]] [[Category:Main Algorithm]]2 KB (393 words) - 22:51, 19 June 2015
- [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]1 KB (257 words) - 15:01, 11 October 2014
- [[Category:Algorithm]] '''Type of algorithm:''' loop2 KB (369 words) - 23:12, 19 June 2015
- [[Category:Algorithm]] '''Type of algorithm:''' loop3 KB (438 words) - 23:13, 19 June 2015
- '''Type of algorithm:''' loop # Terminate the algorithm if the end of the list is reached or, otherwise, if <math>\Kappa</math> is2 KB (262 words) - 23:10, 19 June 2015
- [[Category:Algorithm]] '''Type of algorithm:''' loop5 KB (762 words) - 13:39, 3 March 2017
- [[Category:Algorithm]] '''Type of algorithm:''' loop3 KB (528 words) - 13:46, 3 March 2017
- [[Category:Algorithm]] '''Type of algorithm:''' loop3 KB (454 words) - 13:39, 3 March 2017
- '''Type of algorithm :''' loop. Feasibility of <math>f</math> follows immediately from the invariant. If the algorithm terminates, the break condition immediately proves maximality along with th2 KB (334 words) - 10:43, 8 January 2015
- [[Category:Algorithm]] '''Type of algorithm:''' loop3 KB (425 words) - 13:38, 3 March 2017
- [[Category:Algorithm]] '''Type of algorithm:''' loop3 KB (477 words) - 23:13, 19 June 2015
- '''Type of algorithm:''' loop ...o next is void, insert <math>K</math> in that empty slot and terminate the algorithm. Otherwise, proceed in that direction.4 KB (716 words) - 13:39, 3 March 2017
- '''Type of algorithm:''' loop ...e invariant of the [[Successive shortest paths|successive shortest paths]] algorithm.4 KB (757 words) - 14:39, 20 February 2015
- ...o see (and follows from the [[Classical eulerian cycle algorithm|classical algorithm]]) that a graph <math>G</math> is eulerian if, and only if: [[Classical eulerian cycle algorithm]]2 KB (307 words) - 20:57, 12 November 2014
- # It may be reasonable to implement a graph traversal algorithm in the form of an iterator, which returns the processed nodes and/or the tr # [[Dijkstra|Dijkstra's algorithm]] may be implemented as a graph traversal that returns the nodes in the ord2 KB (314 words) - 19:06, 9 November 2014
- [[Category:Algorithm]] '''Type of algorithm:''' loop3 KB (584 words) - 23:12, 19 June 2015
- [[Category:Algorithm]] '''Type of algorithm:''' loop4 KB (635 words) - 23:12, 19 June 2015
- ...ization and slight modification of the [[Preflow-push|generic preflow-push algorithm]]: ...the residual capacity of <math>(v,w)</math> as in the generic preflow-push algorithm; here it is the minimum of these two values ''and'' a third value, <math>\D5 KB (916 words) - 17:29, 18 December 2017
- '''Type of algorithm:''' loop ...-first search|DFS]] with one modification: Instead of an arborescence, the algorithm returns a [[Basic graph definitions#Forests, trees, branchings, arborescenc2 KB (294 words) - 07:28, 3 November 2014
- '''Type of algorithm:''' loop # If <math>p=</math>void, terminate the algorithm and return the value of <math>c</math>.2 KB (265 words) - 23:10, 19 June 2015
- ...ft open in the definition. The choice of these types is deferred until the algorithm is called or an object of the data structure is created.2 KB (290 words) - 12:45, 21 May 2015
- '''Type of algorithm:''' loop ...eventual contents of <math>M</math> will be returned as the result of the algorithm.2 KB (318 words) - 19:50, 6 October 2014
- [[Category:Algorithm]] '''Type of algorithm:''' loop4 KB (724 words) - 23:19, 19 June 2015
- == Algorithm == # An algorithm is associated with an [[#Algorithmic problem|algorithmic problem]].12 KB (1,782 words) - 12:49, 28 April 2016
- ''' Type of algorithm:''' recursion with an arbitrarily chosen start node <math>s\in V</math> as # If <math>x\neq s</math>, terminate the algorithm with the statement that no eulerian cycle exists.4 KB (673 words) - 08:15, 2 November 2015
- '''Type of algorithm:''' recursion. ...aph search]] from the [[Classical bipartite cardinality matching|classical algorithm]] for the restriction to [[Basic graph definitions#Bipartite and k-partite4 KB (671 words) - 09:25, 22 February 2015
- File:V15 Hungarian Algorithm 1.jpg|Hungarian Algorithm 1 File:V15 Hungarian Algorithm 2.jpg|Hungarian Algorithm 25 KB (732 words) - 09:07, 13 February 2016
- [[Category:Algorithm]] '''Type of algorithm:''' loop10 KB (1,690 words) - 13:58, 3 March 2017
- [[Category:Algorithm]] [[Category:Main Algorithm]]4 KB (707 words) - 10:13, 21 September 2015
- This is a specialization of the [[Preflow-push|generic preflow-push algorithm]]: ...ty|complexity considerations]] for the [[Preflow-push|generic preflow-push algorithm]] yield <math>\mathcal{O}(n^2)</math> relabel operations and forward steps3 KB (443 words) - 09:20, 14 December 2015
- [[Category:Algorithm]] '''Type of algorithm:''' Text4 KB (689 words) - 23:19, 19 June 2015
- '''Type of algorithm:''' loop # If there is none, terminate the algorithm.6 KB (1,107 words) - 10:08, 6 May 2015
- # [[Simple string matching algorithm]]725 bytes (110 words) - 09:22, 29 April 2015
- '''Also known as:''' ''push-relabel'' algorithm or ''Goldberg-Tarjan'' algorithm '''Type of algorithm:'''9 KB (1,560 words) - 03:53, 20 June 2017
- [[Category: Algorithm]] '''Type of algorithm:''' loop7 KB (1,135 words) - 13:47, 3 March 2017
- '''Type of algorithm:''' loop. # If <math>t</math> is ''not'' seen, the break condition applies, and the algorithm is terminated.3 KB (479 words) - 08:37, 7 December 2015
- '''Type of algorithm:''' loop # If the algorithm is not done yet, identify two out of the three index pointers <math>i_1,i_27 KB (1,075 words) - 08:30, 30 May 2015
- '''Type of algorithm:''' loop. # The algorithm is named after three indian researchers, V. M. Malhotra, M. Pramodh Kumar,4 KB (788 words) - 11:27, 16 March 2017
- '''Type of algorithm:''' loop ...</math> is <math>-c(v,w)</math> in case <math>(w,v)\in A_f</math>. Let the algorithm [[Basics of shortest paths#Constructing a shortest-paths arborescence or a7 KB (1,256 words) - 15:18, 5 February 2015
- '''Type of algorithm:''' loop # If <math>p=</math> void, terminate the algorithm and return '''false'''.4 KB (628 words) - 12:57, 18 September 2015
- '''Type of algorithm:''' loop It remains to show that the algorithm indeed terminates. This is proved by the following complexity consideration8 KB (1,416 words) - 07:59, 30 November 2015
- * [[Simple string matching algorithm]] (DONE) * [[Alternating paths algorithm]]4 KB (380 words) - 15:13, 30 November 2020
- [[Category:Algorithm]] '''Type of algorithm:''' loop4 KB (708 words) - 23:17, 19 June 2015
- [[Category:Algorithm]] [[Category:Main Algorithm]]6 KB (1,053 words) - 14:36, 16 September 2015