enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Breadth-first search - Wikipedia

    en.wikipedia.org/wiki/Breadth-first_search

    For example, in a chess endgame, a chess engine may build the game tree from the current position by applying all possible moves and use breadth-first search to find a win position for White. Implicit trees (such as game trees or other problem-solving trees) may be of infinite size; breadth-first search is guaranteed to find a solution node [ 1 ...

  3. Search algorithm - Wikipedia

    en.wikipedia.org/wiki/Search_algorithm

    Examples of the latter include the exhaustive methods such as depth-first search and breadth-first search, as well as various heuristic-based search tree pruning methods such as backtracking and branch and bound. Unlike general metaheuristics, which at best work only in a probabilistic sense, many of these tree-search methods are guaranteed to ...

  4. Lexicographic breadth-first search - Wikipedia

    en.wikipedia.org/wiki/Lexicographic_breadth...

    The algorithm is called lexicographic breadth-first search because the order it produces is an ordering that could also have been produced by a breadth-first search, and because if the ordering is used to index the rows and columns of an adjacency matrix of a graph then the algorithm sorts the rows and columns into lexicographical order.

  5. Tree traversal - Wikipedia

    en.wikipedia.org/wiki/Tree_traversal

    By contrast, a breadth-first search will never reach the grandchildren, as it seeks to exhaust the children first. A more sophisticated analysis of running time can be given via infinite ordinal numbers ; for example, the breadth-first search of the depth 2 tree above will take ω ·2 steps: ω for the first level, and then another ω for the ...

  6. Widest path problem - Wikipedia

    en.wikipedia.org/wiki/Widest_path_problem

    In any graph, directed or undirected, there is a straightforward algorithm for finding a widest path once the weight of its minimum-weight edge is known: simply delete all smaller edges and search for any path among the remaining edges using breadth-first search or depth-first search. Based on this test, there also exists a linear time ...

  7. Parallel breadth-first search - Wikipedia

    en.wikipedia.org/wiki/Parallel_breadth-first_search

    The breadth-first-search algorithm is a way to explore the vertices of a graph layer by layer. It is a basic algorithm in graph theory which can be used as a part of other graph algorithms. For instance, BFS is used by Dinic's algorithm to find maximum flow in a graph.

  8. Brandes' algorithm - Wikipedia

    en.wikipedia.org/wiki/Brandes'_algorithm

    The breadth-first search starts at , and the shortest distance () of each vertex from is recorded, dividing the graph into discrete layers. Additionally, each vertex v {\displaystyle v} keeps track of the set of vertices which in the preceding layer which point to it, p ( v ) {\displaystyle p(v)} .

  9. Connectivity (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Connectivity_(graph_theory)

    The problem of determining whether two vertices in a graph are connected can be solved efficiently using a search algorithm, such as breadth-first search. More generally, it is easy to determine computationally whether a graph is connected (for example, by using a disjoint-set data structure ), or to count the number of connected components.