Skip to content

FF3R/Logistics-distribution-centers-dijkstra-algorithm

View on GitHub ↗Related repositories →

This project involves developing a Java program that optimizes logistics operations by determining the most cost-effective distribution centers to build and assigning clients to them. Using Dijkstra's algorithm, the program minimizes total annual costs by calculating the shortest paths between clients and distribution centers.

active 2024-08-17 → 2024-08-19 (UTC)

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

Activity over time

Daily event counts in the loaded window

Line chart, 3 days from 2024-08-17 to 2024-08-19. Pushes: 0 total, peak 0 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: 1 total, peak 1 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

Nobody pushed, opened or commented here in the loaded window — this repo's activity is stars and forks only.

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 — 1 stars here means stars gained during the window, not the repo's star count.