A tridiagonal matrix, a special but easy to use matrix is introduced. Here, looking into a simultaneous linear eq...
BFS (Breadth-First Search) is one of the popular ways to search all of the vertices on a given graph. I write this article to understand well.
This time I introduced the simple way to remember the rotation matrix. Where is the minus sign? Which comes first, sin or cos? You can easily calculate the matrix if you read this.
This time I introduce Floyd-Warshall algorithm that finds the minimum distance between all vertex pairs with O(V^3) complexity. Read this!