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.
masoud-al/graph-codes
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|