Skip to content

licence00/Dynamic_Graph_Algorithm-SCC

View on GitHub ↗Related repositories →

Proposed approach uses an SCC tree structure to represent the hierarchical organization of SCCs. Incremental and Decremental components, updates the SCC structure. The incremental component handles edge insertions, while decremental component manages edge deletions. This is to overcome the recomputation of SCC on whole graph again.

active 2024-05-18 → 2024-06-10 (UTC)

Complete coverage27,393 / 27,393 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-09-29 (UTC)
Events
20
Pushes
19
Pull requests
0
Issues
0
Stars
0
Forks
1

Activity over time

Daily event counts in the loaded window

Line chart, 24 days from 2024-05-18 to 2024-06-10. Pushes: 19 total, peak 10 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
licence00191900

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.