kdajskdjla alsdklsa For more articles Subscribe and follow my blog and me. If you have doubts in expanding and exploring research with this article kindly send me mail( balakawshik2000@gmail.com ) regarding your doubt. I am open to clarify. Attribution: Some Images were taken from unsplash.com Under a free license scheme. Images were used with proper attribution in the ALT tag of every Image. Remaining Images were created by me using( draw.io ) and I declare them as Open Source and Attribution is not mandatory.
Introduction
The Parallel Line Search Algorithm uses tow parallel lines to navigate to thee nodes that need to be explored. It is optimised variation of Breadth First Search. Many of search algorithm exist but they either work biased like searching left, right, top or bottom.
Working
Step 1: The algorithm first visit the Root node.
Step 2: Then it visits both Left and Right side (unbiased).
At first you may think that it works like Bidirectional Search Algorithm Just wait a minute.
Step 4: Find all Children.
Step 5: Visit all Children.
Visiting Left Child
Visiting Right Child
Step 6: The search continues in the same way(i.e., repeat from Step 3 until the solution is found or the entire tree).
Step 7: Stop
It drastically reduce the amount of required for exploration of nodes. If branching factor of tree is b and distance of goal node from source is d, then the normal BFS/DFS searching complexity would be O(b^d).
On the other hand, if we execute two search operation then the complexity would be O(b^(d/2)) for each search and total complexity would be O(b^(d/2) +b^(d/2)) which is far less than O(b^d).
Performance Measures:
Completeness: Yes
Optimality: BFS is optimal if path cost is a non-decreasing function of the depth of the node.
Time and Space Complexity : Time and space complexity is O(b^(d/2)).
Comments
Post a Comment