Skip to content

The goal of the project is to create an algorithm based on Dijkstra's and other variants to find the shortest cycling path in Brussels.

active 2023-10-272023-11-23 (UTC)

Complete coverage26,339 / 26,339 hourly files (100%) · 2 absent upstream2023-08-152026-08-16 (UTC)
Events
27
Pushes
9
Pull requests
2
Issues
7
Stars
1
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 28 days from 2023-10-27 to 2023-11-23. Pushes: 9 total, peak 3 in a day. Pull requests: 2 total, peak 2 in a day. Issues: 7 total, peak 4 in a day. Comments: 1 total, peak 1 in a day. Stars: 1 total, peak 1 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
JustRayCB13810
zizou2k5111
moussatllh1000

Recent activity

Latest issues, pull requests and releases

  • Pull request#5JustRayCB2023-11-23 18:26
  • Pull request#5zizou2k2023-11-23 18:24
  • Issue comment#4zizou2k2023-11-21 16:54
    testing issues
  • Issue#4zizou2k2023-11-21 16:54
    testing issues
  • Issue#4zizou2k2023-11-21 16:51
    testing issues
  • Issue#2JustRayCB2023-11-21 16:47
    Create graph of roads in Bxl
  • Issue#3JustRayCB2023-11-09 14:54
    Dijkstra's algorithm
  • Issue#2JustRayCB2023-11-09 14:51
    Create graph of roads in Bxl
  • Issue#1JustRayCB2023-11-09 14:35
    Do the graph
  • Issue#1moussatllh2023-11-09 14:33
    Do the graph

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1 stars here means stars gained during the window, not the repo's star count.