**For Large Graphs** : Increase the size of hash table in NERD.h (look for **hash_table_size**) accordingly.

The algorithm expects a **directed weighted edgelist**. If your graph is unweighted, please add 1 as weight for all edges. For undirected graphs, please add 2 edges ( in both directions) corresponding to each edge.

For bipartite undirected graphs, one can treat edges directed from the left set to the right set snd doubling of edges is not required.

For bipartite undirected graphs, one can treat edges directed from the left set to the right set and doubling of edges is not required.