An experiment in scalable routing as an encrypted IPv6 overlay network
-
Updated
May 31, 2024 - Go
An experiment in scalable routing as an encrypted IPv6 overlay network
Bellman-Ford algorithm is used to find the shortest paths from a single source vertex to all other vertices in a weighted graph.
NFOpt is a tool for optimizing network flows by formulating and solving several types of optimization problems as well as multicommodity flow routing.
Intermodal Mobility Information System
Universal matching / routing protocol using ZKP.
Clients for the Routing API
osr is a memory efficient multi-mode OpenStreetMap router
Fast shortest path calculations for Rust
Repository of algorithms and data for public transit routing
Display a map, select and calculate a route with toll between waypoints.
This Elaborates the Working of routers with RIP protocol having Telnet, Password and many more others
C++ REST API Framework
Clients for the Routing OSM API
Project Lab to experiment with File Base Routing similar to Server Side Libs/Fwrks, but on client side with React and Vite.
a simple network routing simulation software.
Router implemented with static forwarding tables. It handles IPV4 , ARP, ICMP packets, and uses Longest Prefix Match for routing decisions.
Welcome to Navigine Indoor Routing Library, a special portal that involves a set of navigation algorithms for working with the routing graph that are useful for creating location-powered solutions of Indoor Navigation and Wayfinding for various spaces and environments..
Add a description, image, and links to the routing-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the routing-algorithm topic, visit your repo's landing page and select "manage topics."