Guides ยท Technology
Graph Algorithms Basics
Core graph problem patterns
Graph algorithms solve traversal, reachability, shortest paths, and community/centrality problems using BFS/DFS, Dijkstra, union-find, and PageRank, chosen based on directed/weighted graphs and data size.
- graphs
- bfs
- dfs
- shortest path
- pagerank
Traverse
Use BFS/DFS for reachability, components, and cycle checks.
Find Paths
Dijkstra/A* for weighted shortest paths; union-find for connectivity.
Rank/Cluster
Centrality/PageRank or community detection for influence/groups.
Keep Exploring
Guides
API Basics
APIs let software request data or actions from other systems through defined endpoints and responses.
Comparison
RAM vs Storage
RAM handles what your device is actively working on, while storage keeps apps, files, and system data available over time.
How it works
Global Positioning System
GPS uses timing signals from satellites to calculate a receiver's position on Earth.
What it is
Blockchain
A blockchain is a distributed ledger secured by cryptography and consensus nodes.