A simple tool to generate graphs where there is a edge between vertices u, v if the hop distance between them was <= k in the input graphs. Inputs and outputs in Metis format.
- g++
- NetworKit library
-
Notifications
You must be signed in to change notification settings - Fork 0
Simple tool to generate graphs where evey vertex u is adjecent to all vertices v with hopDistance(u, v) <= k in an input graph
License
42ndBadger/kHop
About
Simple tool to generate graphs where evey vertex u is adjecent to all vertices v with hopDistance(u, v) <= k in an input graph
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published