In the DFS algorithm the fringe priority is : the real cost LIFO The estimated heuristic FIFO In the BFS algorithm the fringe priority is: LIFO FIFO The real cost the estimated heuristic In the Greedy algorithm the fringe priority is: LIFO FIFO The real cost the estimated heuristic 3 points 3 points 3 points
Added by Alicia M.
Close
Step 1
In the DFS algorithm, the fringe priority is LIFO (Last-In- Show more…
Show all steps
Your feedback will help us improve your experience
Derrick Danso and 54 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Use Prim’s algorithm to find a minimum spanning tree for the given weighted graph.
Trees
Minimum Spanning Trees
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD