GraphAlgs

So, I now have the graph’s edges showing in a GUI. I asked Claude to tell me how I could implement having the graph in a fluid and natural way; it told me to use force-directed placement which makes the nodes repel each other like magnets, and the edges act like springs pulling it back together. The physics of it are really nice!

I have installed a new library called SFML - Simple and Fast Media Library. I chose this library because a Reddit thread suggested that it is quite similar to PyGame which from a quick glance at the documentation, it does. And after 15 mins of trying to get a Noto Sans font file load, I now have a Hello World window!

I have now added a README, some sweet ascii art to the program and the README, and the breadth first search algorithm!

I have now implemented a depth first search algorithm into my application! I had an issue where the program would segfault when I ran it. Turns out I missed that I was creating a vector of integers and then treating them like a vector of booleans :p

While I was making that algorithm, I made this nice simple CLI that users can now use to interact with the graph simulation. I have made a nice printMenu() function that means that I don’t have a big print statement clogging up my main function. Also there is a BFS (breadth-first search) option, but that will be implemented next!

My Dijkstra’s algorithm now works nicely! The next item on the agenda will be a nice CLI to allow users to easily add to/remove from and modify the graph and select which algorithms they’d like to run

I now have my own Stack, Queue and Priority Queue classes. I use inheritance on the priority queue class, as it is almost the exact same as the normal queue class, except for pushing, as it makes sure that all of the elements are ordered correctly. There is no output for these yet, however my graph class works, and I have made a method that prints the graph to show you guys!