Graph traversal refers to the problem of visiting all the nodes in a graph in a particular manner. Tree traversal is a special case of graph traversal. In contrast to tree traversal, in general graph traversal each node may have to be visited more than once, and a root-like node that connects to all other nodes might not exist.It can be illustrated in three ways: Postorder ,Preorder ,Inorder. To meet Wikipedias quality standards, this article or section may require cleanup. ... In computer science, A* (pronounced A star) is a graph/tree search algorithm that finds a path from a given initial node to a given goal node (or one passing a given goal test). ... The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph (where some of the edge weights may be negative). ... Best-first search is a search algorithm which optimizes breadth-first search by expanding the most promising node chosen according to some rule. ... Bidirectional search is a graph search algorithm that runs two simultaneous searches: one forward from the initial state, and one backward from the goal, and stopping when the two meet in the middle. ... In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. ... Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. ... In Computer Science Depth-limited search is an algorithm to explore the Vertices of a Graph. ... Dijkstras algorithm, named after its discoverer, Dutch computer scientist Edsger Dijkstra, is a greedy algorithm that solves the single-source shortest path problem for a directed graph with nonnegative edge weights. ... In computer science, the Floyd–Warshall algorithm (sometimes known as the Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed graph. ... Hill climbing is a graph search algorithm where the current path is extended with a successor node which is closer to the solution than the end of the current path. ... Iterative deepening depth-first search or IDDFS is a state space search strategy in which a depth-limited search is run repeatedly, increasing the depth limit with each iteration until it reaches , the depth of the shallowest goal state. ... Johnsons algorithm is a way to solve the all-pairs shortest path problem in a sparse, weighted, directed graph. ... In computer science, uniform-cost search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph. ... In computer science, tree traversal refers to the process of visiting each node in a tree data structure, exactly once, in a systematic way. ...