Skip to content

DaniloTato/dijkstra_visualizer

View on GitHub ↗Related repositories →

simple sfml program with education porpuses that allows the edition and visualization of graphs. Dijkstra's algortihm is use to determine the shortest path to reach each of the nodes created

active 2024-11-02 → 2024-11-03 (UTC)

Archive files: complete28,582 / 28,582 hourly files accounted for (100%) · 2 absent upstream2023-08-15 → 2026-11-17 (UTC)Some event types are under-captured. Data limits →
Events
4
Pushes
2
Pull requests
0
Issues
0
Recorded stars
0
Recorded forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 2 days from 2024-11-02 to 2024-11-03. Pushes: 2 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Recorded stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Recorded stars

Top contributors

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

ContributorContributionsPushesPRsComments
DaniloTato2200

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

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