## Algorithms

### BFS Pathfinding

Visualization of the Breadth-First Search pathfinding algorithm. Set obstacles, start and end points in a network, and watch the pathfinding process.

Try### Heap

Visualization of heap operations, including insertions and deletions. Dynamically displays each step of the operation to help understand the principles of heap operations.

Try### A* Pathfinding

Visualization of the A* pathfinding algorithm. Set obstacles, start and end points in a network, and watch the pathfinding process.

Try### Dijkstra Shortest Path

Given a network, you can set the weights between different nodes, and after selecting the starting point, you can calculate the shortest path to other nodes.

Try### Rate Limit

Rate limiting is a strategy to control the rate of traffic sent or received by a network. Fixed window rate limiting and sliding window rate limiting are the most common rate limiting algorithms. This page shows the characteristics and comparison of these two algorithms.

Try### Token Bucket

Token bucket is a rate limiting algorithm that can be used to control the rate of traffic. You can set the bucket capacity, token generation rate, and request rate, and then draw the curve of successful or failed requests.

Try