3. [3 pts] Suppose that you are searching the graph below to find a path from th

Question

3. [3 pts] Suppose that you are searching the graph below to find a path from the source node S to the goal node G. This contains parts of a large graph that is basically a tree with some cross-connections back up the tree. All the nodes have a forward branching factor of 3 or 4, and a backward branching factor of 2 or 3. You can't come up with a good heuristic, so you can't use A* search. Assume this pattern shown continues on for many levels, so you have over 1,000,000 nodes. Qualitatively speaking, how would you approach searching this graph? What search strategy/strategies would you use, and why? (Yes, this is a very open-ended question. And the explanation is the most important part.) Etc. Etc.

Explanation / Answer

Generally we know that graph is a pictorial representation.
By observing the graph we can get the informatin from that
what is there and what is representating in graph.
The definition of a graph is nodes,attributes and edges
can be give explaination with information.
Graph has list of edges where each edge has a identifer from s to g
By using graphXML that can helpful to format for
graph drawing and visualization packages.
1,000,000 node graph there is a text parsing
and translation.
Use infinite loop for searching strategy.
It is not possible by linked list it can be possible
by only adjacent vertex.

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.