In the previous articles, we have presented graphs with BFS and DFS. The BFS is actually good to find the path with the fewest nodes. But if the path with the fewest nodes is actually the most expensive, then we …
Long time ago (somewhere in 2015) I have written an article about Dijkstra and the shortest path. In that article, I draw a graph on a notebook, just to illustrate what I was trying to traverse: Today, I was thinking …
They say practice makes perfect and in order to improve my data visualization skills I recently took up a weekly challenge. There are multiple ones depending on your interest and tool of choice, most of them advertised on Twitter. Whether …