再利用可能なManimシーン、視覚的な証明、授業で使えるアイデアを含む、Computer Scienceの厳選されたGraph Theoryアニメーション例を閲覧できます。
Computer Science · 5 件のアニメーション
Explains the CAP theorem through an animated distributed system with 3 nodes. A network partition is triggered, and the animation shows the trade-off: choosing CP sacrifices availability while choosing AP allows divergence. Real-world systems are labeled with their CAP classification.
Visualizes Dijkstra's algorithm on a weighted directed graph with 6 nodes. The animation shows the priority queue (min-heap), greedy node exploration, distance table updates at each step, and the final shortest path tree highlighted in gold.
Visualizes Git's underlying commit DAG structure. Commit objects are shown as circles with abbreviated hash IDs, branches as colored labels pointing to commits, and HEAD as a special pointer. Operations animated include: git commit (new node), git branch (new label), git merge (merge commit with two parents), and git rebase (commits replayed on new base).
Shows an 8-node undirected graph and demonstrates two traversal strategies: BFS spreads level by level using a queue, while DFS dives deep using a stack. Visited nodes are colored and the visit order is displayed for each strategy.
Demonstrates the A* search algorithm on a grid map with obstacles, navigating from source S to goal G. Shows the f=g+h cost function for each cell, contrasting the open set (frontier) and closed set (visited), and how the heuristic guides the search more efficiently than BFS. The final path is highlighted in gold.
