Graph search algorithms: The graph search algorithms are used to find a particular node of a graph easily by traversing through its nodes. There are two type of graph searching algorithms are available. That are, depth-first search algorithm and breadth first search algorithm. The depth-first search has a basic level which is uniformed search where, the algorithm searches in a path until it reaches the end of the graph. After the reaching the end, the search starts at the end and backtracks to the start node and tries a different path. The breadth-first search algorithms perform searches by exploring one layer of graph at a time. Here the search starts with one level away from the start node, followed by depth level two, followed by depth level three and so on until the entire graph is traversed. Inconsistent heuristic: A heuristic function is said to be inconsistent in the analysis of path-finding problems in artificial intelligence , if its approximation is always greater than to the approximate distance from any neighbouring vertex to the target. Inconsistent heuristic can be represented as, h(N) > c(N,P) + h(P) where, h is the consistent heuristic function N is any node of the graph P is any decedent of N G is the goal node c(N,P) is the cost of reaching node P from N

Question

Want to see the full answer?

Answer 1

Question

Chapter 3, Problem 24E

Program Plan Intro

Graph search algorithms:

The graph search algorithms are used to find a particular node of a graph easily by traversing through its nodes.

There are two type of graph searching algorithms are available. That are, depth-first search algorithm and breadth first search algorithm.

The depth-first search has a basic level which is uniformed search where, the algorithm searches in a path until it reaches the end of the graph. After the reaching the end, the search starts at the end and backtracks to the start node and tries a different path.

The breadth-first search algorithms perform searches by exploring one layer of graph at a time. Here the search starts with one level away from the start node, followed by depth level two, followed by depth level three and so on until the entire graph is traversed.

Inconsistent heuristic:

A heuristic function is said to be inconsistent in the analysis of path-finding problems in artificial intelligence, if its approximation is always greater than to the approximate distance from any neighbouring vertex to the target.

Inconsistent heuristic can be represented as,
h(N) > c(N,P) + h(P)

where,

h is the consistent heuristic function

N is any node of the graph

P is any decedent of N

G is the goal node

c(N,P) is the cost of reaching node P from N

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

In Computer Science a Graph is represented using an adjacency matrix. Ismatrix is a square matrix whose dimension is the total number of vertices.The following example shows the graphical representation of a graph with 5 vertices, its matrixof adjacency, degree of entry and exit of each vertex, that is, the total number ofarrows that enter or leave each vertex (verify in the image) and the loops of the graph, that issay the vertices that connect with themselvesTo program it, use Object Oriented Programming concepts (Classes, objects, attributes, methods), it can be in Java or in Python.-Declare a constant V with value 5-Declare a variable called Graph that is a VxV matrix of integers-Define a MENU procedure with the following textGRAPHS1. Create Graph2.Show Graph3. Adjacency between pairs4.Input degree5.Output degree6.Loops0.exit-Validate MENU so that it receives only valid options (from 0 to 6), otherwise send an error message and repeat the reading-Make the MENU call in the main…

comp science

Please help me with this practice problem in python : Implement two-level iterative method B = B_{TL} for graph Laplacian matrices. We want the symmetric B. Components: Given a graph, construct its graph Laplacian matrix. Then using Luby's algorithm, construct the P matrix that ensures a prescribed coarsening factor, e.g., 2, 4, or 8 times smaller number of coarse vertices. Since the graph Laplacian matrix is singular (it has the constants in its nullspace), to make it invertible, make its last row and columns zero, but keep the diagonal as it were (nonzero). The resulting modified graph Laplacian matrix A is invertible and s.p.d.. Form the coarse matrix A_c = P^TAP. To implement symmetric two-level cycle use one of the following M and M^T: (i) M is forward Gauss-Seidel, M^T - backward Gauss-Seidel (both corresponding to A) (ii) M = M^T - the ell_1 smoother. Compare the performance (convergence properties in terms of number of iterations) of B w.r.t. just using the smoother M…