Skip to content

Perl class for direct graph data structures and algorithms

active 2024-06-092025-06-30 (UTC)

Complete coverage26,502 / 26,502 hourly files (100%) · 2 absent upstream2023-08-152026-08-23 (UTC)
Events
112
Pushes
42
Pull requests
10
Issues
8
Stars
2
Forks
3

Activity over time

Daily event counts in the loaded window

Line chart, 388 days from 2024-06-09 to 2025-07-24. Pushes: 42 total, peak 8 in a day. Pull requests: 10 total, peak 1 in a day. Issues: 8 total, peak 2 in a day. Comments: 31 total, peak 6 in a day. Stars: 2 total, peak 1 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.

Top contributors

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

ContributorContributionsPushesPRsComments
mohawk27642520
merkys180311
choroba2010
gwselke2010
kester-habermann1000
michal-josef-spacek1000

Recent activity

Latest issues, pull requests and releases

  • Issue#40michro6ok2025-07-24 11:07
    transitive_closure(reflexive => 0) omits isolated vertices
  • Issue#38michal-josef-spacek2025-06-30 14:20
    Issue with Unicode identifier
  • Issue comment#36mohawk22025-03-27 14:53
    Documentation: could you, please, clarify?
  • Issue#36mohawk22025-03-27 14:53
    Documentation: could you, please, clarify?
  • Issue comment#37mohawk22025-03-27 14:52
    Enhancing documentation for betweenness and for weak connectedness
  • Pull request#37mohawk22025-03-27 14:52
  • Pull request#37gwselke2025-03-10 22:20
  • Issue comment#36mohawk22025-03-04 22:05
    Documentation: could you, please, clarify?
  • Issue#36gwselke2025-03-03 14:52
    Documentation: could you, please, clarify?
  • Issue comment#35merkys2025-03-03 10:25
    Implement `connected_subgraphs()`
  • Issue comment#35mohawk22025-03-01 23:58
    Implement `connected_subgraphs()`
  • Pull request#35mohawk22025-03-01 23:53
  • Pull request#35merkys2025-02-13 13:45
  • Issue comment#32mohawk22025-01-12 22:51
    random_graph: edges empty inside random_edge subroutine (changed behaviour of module)
  • Issue#32mohawk22025-01-12 22:50
    random_graph: edges empty inside random_edge subroutine (changed behaviour of module)
  • Issue comment#32mohawk22025-01-12 20:47
    random_graph: edges empty inside random_edge subroutine (changed behaviour of module)
  • Issue#33mohawk22025-01-12 20:37
    There is no method to find max cliques in a graph
  • Pull request#34mohawk22025-01-12 20:37
  • Issue comment#34mohawk22025-01-12 20:36
    Implement the Bron-Kerbosh pivot algorithm to search for max cliques
  • Pull request#34choroba2024-12-23 15:54
  • Issue#33choroba2024-12-23 15:54
    There is no method to find max cliques in a graph
  • Issue#32kester-habermann2024-11-13 16:31
    random_graph: edges empty inside random_edge subroutine (changed behaviour of module)
  • Issue comment#31mohawk22024-07-02 17:25
    Implement is_planar()
  • Issue comment#31merkys2024-07-01 06:22
    Implement is_planar()
  • Issue comment#31mohawk22024-06-29 15:08
    Implement is_planar()

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