please explain me and give some pictures with gif format ,about Bi-DIRECTIONAL SEARCH algorithm, MIN-MAX algorithm, Alpha Beta Pruning alghorithm, Greedy best-first search algorithm ,and Heuristics algorithm .
Read the Graph.txt file to create an adjacency matrix or list.Graph.txt represents anundirected graph. After creating the matrix/list traverse the graph by implementing the BFSalgorithm given above. You should print the distance (or hop) from the source and also the pathfrom source. [Assume 1 is the root node]Sample Graph.txt File (Numbering starts from 1):6 [# of nodes][Edges]1 21 32 12 42 53 13 54 24 54 65 25 35 45 66 46 5
please explain me and give some pictures with gif format ,about Bi-DIRECTIONAL SEARCH algorithm, MIN-MAX algorithm, Alpha Beta Pruning alghorithm, Greedy best-first search algorithm ,and Heuristics algorithm .