Skip to content

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

Notifications You must be signed in to change notification settings

42ndBadger/kHop

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 

Repository files navigation

kHop

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.

Requirements

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

No packages published