Al
|
c67678087f
|
[parser] using a bipartite graph (indptr + indices) to represent postal code<=>admin relationships instead of a set of 64-bit ints. Requires |V(postal codes)| + |E| 32 bit ints instead of |E| 64 bit ints. Saves several hundred MB in file size and even more space in memory because of the hashtable overhead
|
2017-03-18 06:05:28 -04:00 |
|
Al
|
df89387b5c
|
[fix] calloc instead of malloc when performing initialization on structs that may fail halfway and need to clean up while partially initialized (calloc will set all the bytes to zero so the member pointers are NULL instead of garbage memory)
|
2017-01-13 18:30:04 -05:00 |
|
Al
|
67d128c386
|
[graph] graph_load and graph_save
|
2015-10-09 15:36:14 -04:00 |
|
Al
|
1e98932b82
|
[fix] setting array->n after reading in both graph and sparse_matrix implementations
|
2015-10-06 19:28:28 -04:00 |
|
Al
|
4984352eda
|
[graph] Simple sparse graph implementation, essentially a sparse matrix with no values array
|
2015-10-06 18:58:18 -04:00 |
|