An efficient implementation of bipartite graphs used in simulation of erasure codes. The underlying data-structure is a doubly-linked list which keeps track of imediate neighbours in the graph.
-
Notifications
You must be signed in to change notification settings - Fork 1
An efficient implementation of bipartite graphs for used in simulation of erasure codes
License
masoud-al/graph-codes
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An efficient implementation of bipartite graphs for used in simulation of erasure codes
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published