Alternatives
Products that do what REROUTE does
File-based routing for Python backends
- 1UR
2025 · github.com
- 2RA
2022 · github.com
- 3FB
2024 · docs.sweep.dev
- 4SE
2016 · github.com
- 5IA
Hi HN! This is my pet project, written from scratch because there is so much to discover and learn in the process. The focus is on simplicity and incremental updates. Progress is slow because I do not have much spare time to work on this, but I would love to hear some feedback. Regards
2022 · github.com
- 6

- 7PA
2011 · adeel.github.com
- 8
- 9IB
- 10DS
2023 · github.com
- 11VA
2015 · mapzen.com
- 12FI
2015 · file.io
- 13

File-based HTTP endpoints for Python, where each file carries its own isolated dependencies. - tanrax/bitpoint
Aug 2026 · github.com
- 14

- 15AV
2012 · github.com
- 16PR
2016 · pathfinder.readme.io
- 17

- 18
- 19DP
2025 · github.com
- 20BP
What? Another flow based programming library for Python? Yes. All the FBP libraries out there for Python need to be run as a self contained application. They are not components that could be integrated into your existing data workflows. Barfi, on the other hand can be integrated. At the moment it has a Streamlit component that you can use in your Streamlit apps. Currently, I am working on a Jupyter notebook widget.
2022 · github.com
- 21PC
2017 · github.com
- 22AS
2024 · github.com
- 23SA
Hi HN, we’re Jessie and Eric. We’ve been baking away at Cakework (https://www.cakework.com/), which is a way to build async backends without needing to manage cloud infrastructure. Cakework is for operations that take time or more compute, like file processing, report generation, or machine learning. Devs write backends as Python functions and deploy them with our CLI. They use our client SDKs to make requests, get status, and get processing results. Each request runs with its own CPU and memory parameters in its own microVM, with no timeouts. Devs can query for failures and…
2023 · cakework.com
- 24AC
2025 · niquests.readthedocs.io
Ranked by how close each launch is in meaning, then by votes. Refine with a description →