Search results

• Graph traversal
  # 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 ord
  2 KB (314 words) - 19:06, 9 November 2014
• Heap as array: ascendItem
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (584 words) - 23:12, 19 June 2015
• Heap as array: descendItem
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  4 KB (635 words) - 23:12, 19 June 2015
• Preflow-push with excess scaling
  ...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>\D
  5 KB (916 words) - 17:29, 18 December 2017
• Repeated depth-first search
  '''Type of algorithm:''' loop ...-first search|DFS]] with one modification: Instead of an arborescence, the algorithm returns a [[Basic graph definitions#Forests, trees, branchings, arborescenc
  2 KB (294 words) - 07:28, 3 November 2014
• Array list: number
  '''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
• Genericity
  ...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
• Shortest paths by repeated squaring
  '''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
• B-tree: merge two siblings
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  4 KB (724 words) - 23:19, 19 June 2015
• Algorithms and correctness
  == Algorithm == # An algorithm is associated with an [[#Algorithmic problem|algorithmic problem]].
  12 KB (1,782 words) - 12:49, 28 April 2016
• Classical eulerian cycle algorithm
  ''' 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
• Maximum matching by Edmonds
  '''Type of algorithm:''' recursion. ...aph search]] from the [[Classical bipartite cardinality matching|classical algorithm]] for the restriction to [[Basic graph definitions#Bipartite and k-partite
  4 KB (671 words) - 09:25, 22 February 2015
• Lecture: Efficient Graph Algorithms
  File:V15 Hungarian Algorithm 1.jpg|Hungarian Algorithm 1 File:V15 Hungarian Algorithm 2.jpg|Hungarian Algorithm 2
  5 KB (732 words) - 09:07, 13 February 2016
• B-tree: remove
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  10 KB (1,690 words) - 13:58, 3 March 2017
• Simple string matching algorithm
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  4 KB (707 words) - 10:13, 21 September 2015
• FIFO preflow-push
  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 steps
  3 KB (443 words) - 09:20, 14 December 2015
• B-tree: insert and rearrange
  [[Category:Algorithm]] '''Type of algorithm:''' Text
  4 KB (689 words) - 23:19, 19 June 2015
• Successive shortest paths
  '''Type of algorithm:''' loop # If there is none, terminate the algorithm.
  6 KB (1,107 words) - 10:08, 6 May 2015
• One-dimensional string matching
  # [[Simple string matching algorithm]]
  725 bytes (110 words) - 09:22, 29 April 2015
• Preflow-push
  '''Also known as:''' ''push-relabel'' algorithm or ''Goldberg-Tarjan'' algorithm '''Type of algorithm:'''
  9 KB (1,560 words) - 03:53, 20 June 2017

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)