Simplify Best-First Search code by integrating Node functionality directly

[biswajit-sarkar-007]

Pull Request: Refactor Best-First Search Implementation #1

Description

This pull request refactors the Best-First Search algorithm implementation in Java by removing the nested Node class and simplifying the code structure. The following changes have been made:

• Removed Node Class: The separate Node class was eliminated, and its functionality has been integrated directly into the main search algorithm. This change reduces complexity and improves readability.

• Updated Priority Queue: The priority queue now directly utilizes the node names (as strings) with a comparator based on the heuristic values, streamlining the node management process.

• Preserved Functionality: The core functionality of the Best-First Search algorithm remains intact, ensuring that the algorithm still correctly finds the optimal path from the start node to the goal node.

• Example Graph and Heuristics: The example graph and heuristic values have been maintained to demonstrate the usage of the algorithm in the main method.

Benefits

• Improved Readability: The code is easier to read and understand without the extra nested class.
• Simplified Structure: The direct use of strings in the priority queue simplifies node handling and reduces overhead.
• Maintainability: Fewer classes mean less complexity, making the codebase easier to maintain.

Testing

The algorithm has been tested with the provided example, and it successfully finds the path from the start node to the goal.

Please review the changes and let me know if you have any questions or suggestions!