Commit dde0cc04 authored by Megha Khosla's avatar Megha Khosla

Update readme.md

parent 4d0a8ecf
......@@ -5,7 +5,7 @@
**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.
**Example command for training** : ./NERD -train edgelist.txt -output1 hub.txt -output2 auth.txt -binary 0 -size 128-walkSize 5 -negative 5 -samples 10 -rho 0.025 -threads 20 -joint 1 -inputvertex 0
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment