Search results

• Breadth-first search
  [[Category:Graph Traversal]] '''Algorithmic problem:''' [[Graph traversal]]
  7 KB (1,165 words) - 07:50, 26 October 2015
• Successive shortest paths
  ...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 # the subpath of the [[Basic graph definitions#Transpose|transpose]] of <math>p</math> from the start node of
  6 KB (1,107 words) - 10:08, 6 May 2015
• Depth-first search
  [[Category:Graph Traversal]] '''Algorithmic problem:''' [[Graph traversal]]
  11 KB (1,966 words) - 06:52, 26 October 2015
• Asymptotic complexity of algorithms
  ...f edges/arcs in a [[Basic graph definitions#Directed and undirected graphs|graph]].
  4 KB (700 words) - 05:54, 25 April 2016
• Preflow-push
  # The current arc of a node is an outgoing arc of the node's in the residual graph. In the list of all of these arcs, no admissible arc precedes the current a For the [[Basic graph definitions#Subgraphs|subgraph induced]] by <math>V\setminus\{s\}</math>, t
  9 KB (1,560 words) - 03:53, 20 June 2017
• 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
• Kruskal for maximum spanning forest
  #The [[undirected graph]] <math>F_i = (V,E_i)</math>, where <math>E_i</math> is the set of all sele #For the [[undirected graph]] <math>F_i = (V,E_i)</math>, there is a maximum spanning forest <math>F_i'
  5 KB (812 words) - 18:31, 20 September 2015
• Negative cycle-canceling
  ...blems|maximum flow]] from <math>s</math> to <math>t</math> in the extended graph (cost factors and balance values are disregarded). ...arithmetic operations and comparisons of flows are arc-wise. For a [[Basic graph definitions#Cycles|generalized cycle]] <math>C</math> and <math>\varepsilon
  7 KB (1,256 words) - 15:18, 5 February 2015
• Directed Tree
  # A '''directed tree''' is a directed graph <math>T = (V,A)</math> with a designated node <math>r \in V</math>, the ''' ...th>v \in V</math> and let <math>d_v</math> denote <math>v</math>'s [[Basic graph definitions#Adjacency, incidence, and degree|outdegree]]. If <math>d_v > 0<
  7 KB (1,284 words) - 11:29, 26 May 2015
• Binary search tree
  ...es]], "well-formed" means that, for any node, there is exactly one [[Basic graph definitions#Paths|path]] from the root to that node.
  2 KB (353 words) - 06:14, 6 July 2015
• Bellman-Ford
  ...atrix <math>L</math>, where <math>n=|V|</math>. This matrix represents the graph and the arc lengths and will not be changed throughout the algorithm.
  2 KB (393 words) - 22:51, 19 June 2015
• Floyd-Warshall
  ...hoortest <math>(v,w</math>-path subject to the constraint that all [[Basic graph definitions#Paths|internal nodes]] are taken from <math>\{u_1, \ldots, u_n
  3 KB (510 words) - 09:28, 24 May 2022
• Ahuja-Orlin
  A [[Breadth-first search|BFS]] is run on the [[Basic graph definitions#Transpose|transpose]] of <math>G</math> with start node <math>t
  8 KB (1,416 words) - 07:59, 30 November 2015

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