Issue: #419, Issue: #238, and Issue: #240

[Saj18]

#419 -Implemented the deleteNodeById function in the Graph class to delete a node by its ID. -Utilized a lambda function with std::find_if to search for the node with the provided ID within the unordered map of nodes. -If the node is found, it is erased from the map using nodes.erase(it). -Returns true if the node is successfully deleted and false if the node is not found.

#238

• Implemented Dinic's algorithm for finding the maximum flow in a flow network.
• Added necessary methods and data structures to the Graph class.
• Implemented BFS and DFS helper functions for the algorithm.

#240

1. Implemented Krager's algorithm for partitioning a graph into two clusters.
2. Added the kragersAlgorithm method to the Graph class.
3. Added necessary data structures and utilities to support the algorithm.
4. Utilized randomization for edge selection within the algorithm.

[ZigRazor]

Another things, can you add tests for your algorithm implementation and for the node search by ID? Thank you in advance!

[nolankramer]

My comments largely reflect @ZigRazor's comments, so mine can be ignored.