Dynamic graph representation using per-node dynamic contiguous arrays of edges, efficiently indexable by node. Roughly the same memory as CSR sparse matrices but with O(1) edge insertion.
-
Notifications
You must be signed in to change notification settings - Fork 0
Dynamic graph representation using per-node dynamic contiguous arrays of edges, efficiently indexable by node. Roughly the same memory as CSR sparse matrices but with O(1) edge insertion.
License
goodcleanfun/graph
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Dynamic graph representation using per-node dynamic contiguous arrays of edges, efficiently indexable by node. Roughly the same memory as CSR sparse matrices but with O(1) edge insertion.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published