proxy.golang.org : github.com/jroimartin/mkdigraph
Mkdigraph generates random directed graphs. It uses a stream generator, so the full graph is not stored in memory, which makes it possible to generate graphs of arbitrary size. Usage: The flags are: Unless the -dot flag is specified, it prints the graph in the format: Each line specifies either a vertex or an edge. Lines starting with "V:" define vertices, followed by the ID and the label of the vertex. Lines starting with "E:" define edges, followed by the IDs of the tail and head vertices. All fields are separated by a single space. Note that even if -prob=1, if -loops=false the resulting digraph will have a vertex with no outgoing edges. If the -words flag is specified, vertex labels are selected from the provided words file. Each label is sanitized by removing any characters that match the regular expression '[^a-zA-Z]'. If the number of vertices exceeds the number of available labels, then duplicated labels are suffixed with the vertex number.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/jroimartin/mkdigraph
License: MIT
Latest release: 2 months ago
First release: 2 months ago
Namespace: github.com/jroimartin
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 20 days ago