Uncategorized

Dijkstra’s algorithm is a method to calculate the shortest path from one node to another with weighted edges. It does not work for negative edge weights, however. Fun fact: it is a main algorithm used in Google Maps. It starts off by setting all the distances of each node to…

You want to try sudoku, but you don’t know where to begin. Sudoku looks hard because it involves numbers, but in reality, it’s not math-based. Even if you think you’re bad at math, you can still do well at sudoku. In fact, the numbers could be replaced with letters or…