Algorithms
APIs for various algorithms. Includes A*, Dijkstra's, Breadth-first, Depth-first, Bellman-For, Floyd-Warshall, Topological sort, Kruskal's Minimum Spanning Tree, Binary search, Quick sort, Merge sort, and Heap sort.
1 subscribers
8.7/10 popularity
439 ms avg latency
100% success rate
13 endpoints
The in-depth APIMemo review for this API hasn't been published yet —
the data below comes straight from the public marketplace listing.
Algorithms endpoints
| Method | Endpoint | Description |
|---|---|---|
| pathfinding | ||
| POST |
astar /astar |
Run the A* pathfinding algorithm. |
| POST |
dijkstra's /dijkstra |
Run Dijkstra's Algorithm. |
| POST |
breadth-first search /bfs |
Searches a graph using breadth-first search. |
| POST |
Depth-first search /dfs |
Search a graph with depth-first search |
| graph | ||
| POST |
Bellman-Ford /bellman-ford |
Use the Bellman-Ford algorithm. |
| POST |
Floyd-Warshall /floyd-warshall |
Use the Floyd-Warshall algorithm. |
| POST |
Topological Sort /topological-sort |
Perform a topological sort |
| POST |
Minimum Spanning Tree /mst |
Use Kurskal's Minimum Spanning Tree. |
| sorting | ||
| POST |
Binary Search /binary-search |
Perform a binary search. Array must be sorted. |
| POST |
Quick Sort /quick-sort |
Perform a quick sort on an array. |
| POST |
Merge Sort /merge-sort |
Perform a merge sort on an array. |
| POST |
Heap Sort /heap-sort |
Perform a heap sort on an array. |
| Other endpoints | ||
| GET |
info /info |
Get information about the API. |
Algorithms pricing
| Plan | Price | Rate limit | Quotas |
|---|---|---|---|
| BASIC | Free | 5 / second |
|
| PRO | $8.99 / month | — |
|
| ULTRA | $15.99 / month | — |
|
| MEGA Recommended | $29.99 / month | — |
|
