Search results

• Kosaraju
  [[Category:Graph Algorithms]] ...t <math>G^t=(V,A^t)</math> be the [[Basic graph definitions#Transpose of a graph|transpose]] of <math>G=(V,A)</math>.
  4 KB (789 words) - 07:37, 2 November 2015
• Basics of shortest paths
  ...a [[Basic graph definitions#Directed and undirected graphs|simple directed graph]] and for each arc <math>a\in A</math> let <math>\ell(a)</math> be a real n ...th''' of an [[Basic graph definitions#Paths|ordinary path]] (incl. [[Basic graph definitions#Cycles|ordinary cycles]]) is the sum of the lengths of all arc
  11 KB (2,059 words) - 14:34, 5 December 2014
• Three indians' algorithm
  There is no more [[Basic graph definitions#Paths|ordinary <math>(s,t)</math>-path]] in <math>G</math>. ...4+5 from <math>v_0</math> on the [[Basic graph definitions#Transpose of a graph|transpose]] of <math>G</math> with the value of <math>T(v_0)</math> as comp
  4 KB (788 words) - 11:27, 16 March 2017
• Dinic
  # Construct the [[Basic graph definitions#Cycles|acyclic]] [[Basic graph definitions#Subgraphs|subgraph]] <math>G'=(V',A')</math> of the residual ne # Use one of the algorithms for the [[Blocking flow|blocking flow]] problem to construct a blocking flo
  2 KB (334 words) - 10:43, 8 January 2015
• Breadth-first search
  [[Category:Algorithms]] [[Category:Search Algorithms]]
  7 KB (1,165 words) - 07:50, 26 October 2015
• Successive shortest paths
  ...orks on a nonnegative variation of the cost values, which allows efficient algorithms. ...minimal sets|inclusion-maximal]] subpaths of <math>C</math> whose [[Basic graph definitions#Paths|internal nodes]] do not belong to <math>p</math>. In oth
  6 KB (1,107 words) - 10:08, 6 May 2015
• Depth-first search
  [[Category:Algorithms]] [[Category:Search Algorithms]]
  11 KB (1,966 words) - 06:52, 26 October 2015
• Basic flow definitions
  # [[Basic graph definitions]] ...definitions#Directed and undirected graphs|anti-symmetric, simple directed graph]], unless stated otherwise.
  11 KB (2,126 words) - 13:42, 17 November 2015
• Dijkstra
  [[Category:Graph Algorithms]] ...er one from <math>t</math> on the [[Basic graph definitions#Transpose of a graph|transpose]] of <math>G</math>. This variant is called '''bidirectional sear
  10 KB (1,765 words) - 08:35, 14 January 2021

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