Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps 🌍.
-
Updated
Oct 27, 2016 - C++
Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps 🌍.
| SCHOOL_42_UPDATE 2020 | This repository contains ALL PROJECTS, TASKS AND SUBJECTS OF THE MAIN PROGRAM OF LEARNING AT SCHOOL 42 ( Program | Course | Programing | Coding | School 42 | Ecole 42 | School 21 | Школа 42 | Школа 21 ). Этот репозиторий содержит все проекты и задания основной программы обучения Школы 42 и Школы 21
[NeurIPS 2021] Official implementation of the paper "One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective"
This project demonstrates how to use AWS Bedrock with Anthropic Claude and Amazon Nova models to create a web automation assistant with tool use, human-in-the-loop interaction, and vision capabilities.
A multi-agent AI architecture that connects 25+ specialized agents through n8n and MCP servers. Project NOVA routes requests to domain-specific experts, enabling control of applications from knowledge bases to DAWs, home automation to development tools. Includes system prompts, Dockerfiles, and workflows for a complete AI assistant ecosystem.
Visualization of car traffic in Paris from data published by the OpenData-Paris project.
🍷 🇫🇷 The french bot's ecosystem
Observatoire du Plan Vélo
A native iOS app to explore, track, and complete every transit station in the Paris region (Île-de-France), with gamification, iCloud sync, and zero dependencies.
Comparison of driving and bicycling times in Paris and neighborhoods
Outil pour analyser vos déplacements à Vélib' en toute simplicité.
Home Assistant custom integration to pull data out of Eau d'île de France
A tool for calculating the "blackhole" status in the 42 curriculum.
To associate your repository with the paris topic, visit your repo's landing page and select "manage topics."