Test added and findNode fixed with O(1) complexity - Githubissues

pharo-ai / graph-algorithms

A graph algorithms library implemented in Pharo

MIT License

22 stars 12 forks source link

Test added and findNode fixed with O(1) complexity #31

Closed virenvarma007 closed 1 year ago

jordanmontt commented 1 year ago

Thanks @virenvarma007 !

Some observations:

Could you find another name for the instance variable dictNodes ? please
Can you format the code?
The test is good, but can you rename testdictNodes to something else? Also, can you add other tests that. 1) The test does not call the run method. Only test that setting and getting the nodes works well. 2) Some other tests that test only one simple thing