Skip to content

devavinothm/hospitals-hill-climbing-algorithm

View on GitHub ↗Related repositories →

Place hospitals on the grid so that the sum of distance from any house to its closest hospital results as small as possible. We can use hill climbing algorithm here to solve for local optimums. In order to have a better chance of finding the global optimum, we can use the random restart algorithm which re-run several iterations of hill climbing...

active 2024-06-022024-06-02 (UTC)

Complete coverage26,633 / 26,633 hourly files (100%) · 2 absent upstream2023-08-152026-08-28 (UTC)
Events
3
Pushes
1
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-06-02 to 2024-06-02. Pushes: 1 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. Stars: 0 total, peak 0 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
devavinothm1100

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.