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

What are the major threats of using the internet? How do you use it? How do children use it? How canwe secure it? Provide four references with your answer. Two of the refernces can be from an article and the other two from websites.

Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…

What did you find most interesting or surprising about the scientist Lavoiser?