- Overview
- Installation
- Usage
- Issues & Bug Reports
- Todo
- Sample Files
- Example of Usage
- Supported Formats
- Similar Works
- Dependencies
- Contribution
- References
- Citing
- Authors
- License
- Show Your Support
- Changelog
- Code of Conduct
Pyrgg is an easy-to-use synthetic random graph generator written in Python which supports various graph file formats including DIMACS .gr files. Pyrgg has the ability to generate graphs of different sizes and is designed to provide input files for broad range of graph-based research applications, including but not limited to testing, benchmarking and performance-analysis of graph processing frameworks. Pyrgg target audiences are computer scientists who study graph algorithms and graph processing frameworks.
Open Hub | |
PyPI Counter | |
Github Stars |
Branch | master | dev |
CI |
Code Quality |
- Download Version 1.1 or Latest Source
pip install -r requirements.txt
orpip3 install -r requirements.txt
(Need root access)python3 setup.py install
orpython setup.py install
(Need root access)
- Check Python Packaging User Guide
pip install pyrgg==1.1
orpip3 install pyrgg==1.1
(Need root access)
- Check Conda Managing Package
conda install -c sepandhaghighi pyrgg
(Need root access)
- Download Exe-Version 1.1
- Run
PYRGG-1.1.exe
Pyrgg will likely run on a modern dual core PC. Typical configuration is:
- Dual Core CPU (2.0 Ghz+)
- 4GB of RAM
Note that it may run on lower end equipment though good performance is not guaranteed.
Just fill an issue and describe it. I'll check it ASAP! or send an email to info@pyrgg.ir.
- Formats
- DIMACS
- JSON
- YAML
- Pickle
- CSV
- TSV
- WEL
- ASP
- TGF
- UCINET DL
- GML
- GDF
- Matrix Market
- Graph Line
- GEXF
- Sizes
- Small
- Medium
- Large
- Weighted Graph
- Signed Weights
- Unweighted Graph
- Dense Graph
- Sparse Graph
- Directed Graph
- Self loop
- Parallel Arc
- Multithreading
- GUI
- Erdős–Rényi model
- Tree
- Sample 1-DIMACS (100 Vertices , 3KB)
- Sample 2-DIMACS (1000 Vertices , 13KB)
- Sample 3-DIMACS (1000000 Vertices , 7MB)
- Sample 4-DIMACS (5000000 Vertices , 37MB)
- Sample 1-JSON (100 Vertices , 26KB)
- Sample 2-JSON (1000 Vertices , 494KB)
- Sample 1-CSV (100 Vertices , 3KB)
- Sample 2-CSV (1000 Vertices , 51KB)
- Sample 1-TSV (100 Vertices , 29KB)
- Sample 2-TSV (1000 Vertices , 420KB)
- Sample 1-WEL (100 Vertices , 5KB)
- Sample 2-WEL (1000 Vertices , 192KB)
- Sample 1-YAML (30 Vertices , 6KB)
- Sample 2-YAML (100 Vertices , 35KB)
- Sample 1-LP (100 Vertices , 7KB)
- Sample 2-LP (1000 Vertices , 76KB)
- Sample 1-Pickle (100 Vertices , 12KB)
- Sample 2-Pickle (1000 Vertices , 340KB)
- Sample 1-TGF (100 Vertices , 4KB)
- Sample 2-TGF (1000 Vertices , 61KB)
- Sample 1-UCINET DL (100 Vertices , 8KB)
- Sample 2-UCINET DL (1000 Vertices , 729KB)
- Sample 1-MTX (100 Vertices , 59KB)
- Sample 2-MTX (1000 Vertices , 1.8MB)
- Sample 1-GL (100 Vertices , 17KB)
- Sample 2-GL (1000 Vertices , 2.4MB)
- Sample 1-GDF (100 Vertices , 21KB)
- Sample 2-GDF (1000 Vertices , 690KB)
- Sample 1-GML (100 Vertices , 120KB)
- Sample 2-GML (1000 Vertices , 2.4MB)
- Sample 1-GEXF (100 Vertices , 63KB)
- Sample 2-GEXF (1000 Vertices , 6.4MB)
- Generate synthetic data for graph processing frameworks (some of them mentioned here) performance-analysis
- Generate synthetic data for graph benchmark suite like GAP
-
p sp <number of vertices> <number of edges> a <head_1> <tail_1> <weight_1> . . . a <head_n> <tail_n> <weight_n>
-
<head_1>,<tail_1>,<weight_1> . . . <head_n>,<tail_n>,<weight_n>
-
<head_1> <tail_1> <weight_1> . . . <head_n> <tail_n> <weight_n>
-
{ "properties": { "directed": true, "signed": true, "multigraph": true, "weighted": true, "self_loop": true }, "graph": { "nodes":[ { "id": 1 }, . . . { "id": n } ], "edges":[ { "source": head_1, "target": tail_1, "weight": weight_1 }, . . . { "source": head_n, "target": tail_n, "weight": weight_n } ] } }
-
graph: edges: - source: head_1 target: tail_1 weight: weight_1 . . . - source: head_n target: tail_n weight: weight_n nodes: - id: 1 . . . - id: n properties: directed: true multigraph: true self_loop: true signed: true weighted: true
-
<head_1> <tail_1> <weight_1> . . . <head_n> <tail_n> <weight_n>
-
node(1). . . . node(n). edge(head_1,tail_1,weight_1). . . . edge(head_n,tail_n,weight_n).
-
1 . . . n # 1 2 weight_1 . . . n k weight_n
-
dl format=edgelist1 n=<number of vertices> data: 1 2 weight_1 . . . n k weight_n
-
%%MatrixMarket matrix coordinate real general <number of vertices> <number of vertices> <number of edges> <head_1> <tail_1> <weight_1> . . . <head_n> <tail_n> <weight_n>
-
Graph Line(.gl)
<head_1> <tail_1>:<weight_1> <tail_2>:<weight_2> ... <tail_n>:<weight_n> <head_2> <tail_1>:<weight_1> <tail_2>:<weight_2> ... <tail_n>:<weight_n> . . . <head_n> <tail_1>:<weight_1> <tail_2>:<weight_2> ... <tail_n>:<weight_n>
-
GDF(.gdf)
nodedef>name VARCHAR,label VARCHAR node_1,node_1_label node_2,node_2_label . . . node_n,node_n_label edgedef>node1 VARCHAR,node2 VARCHAR, weight DOUBLE node_1,node_2,weight_1 node_1,node_3,weight_2 . . . node_n,node_2,weight_n
-
graph [ multigraph 0 directed 0 node [ id 1 label "Node 1" ] node [ id 2 label "Node 2" ] . . . node [ id n label "Node n" ] edge [ source 1 target 2 value W1 ] edge [ source 2 target 4 value W2 ] . . . edge [ source n target r value Wn ] ]
-
<?xml version="1.0" encoding="UTF-8"?> <gexf xmlns="http://www.gexf.net/1.2draft" version="1.2"> <meta lastmodifieddate="2009-03-20"> <creator>PyRGG</creator> <description>File Name</description> </meta> <graph defaultedgetype="directed"> <nodes> <node id="1" label="Node 1" /> <node id="2" label="Node 2" /> ... </nodes> <edges> <edge id="1" source="1" target="2" weight="400" /> ... </edges> </graph> </gexf>
-
Pickle(.p) (Binary Format)
- Random Modular Network Generator Generates random graphs with tunable strength of community structure
- randomGraph very simple random graph generator in matlab
- Graph1 Random Graph Generator with Max capacity paths (C++)
master | dev |
If you use pyrgg in your research, please cite the JOSS paper ;-)
@article{Haghighi2017, doi = {10.21105/joss.00331}, url = {https://doi.org/10.21105/joss.00331}, year = {2017}, month = {sep}, publisher = {The Open Journal}, volume = {2}, number = {17}, author = {Sepand Haghighi}, title = {Pyrgg: Python Random Graph Generator}, journal = {The Journal of Open Source Software} }
JOSS | |
Zenodo |
1- 9th DIMACS Implementation Challenge - Shortest Paths
2- Problem Based Benchmark Suite
3- MaximalClique - ASP Competition 2013
4- Pitas, Ioannis, ed. Graph-based social media analysis. Vol. 39. CRC Press, 2016.
5- Roughan, Matthew, and Jonathan Tuke. "The hitchhikers guide to sharing graph data." 2015 3rd International Conference on Future Internet of Things and Cloud. IEEE, 2015.
6- Borgatti, Stephen P., Martin G. Everett, and Linton C. Freeman. "Ucinet for Windows: Software for social network analysis." Harvard, MA: analytic technologies 6 (2002).
7- Matrix Market: File Formats
8- Social Network Visualizer
9- Adar, Eytan. "GUESS: a language and interface for graph exploration." Proceedings of the SIGCHI conference on Human Factors in computing systems. 2006.
10- Skiena, Steven S. The algorithm design manual. Springer International Publishing, 2020.
11- Chakrabarti, Deepayan, Yiping Zhan, and Christos Faloutsos. "R-MAT: A recursive model for graph mining." Proceedings of the 2004 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, 2004.
12- Zhong, Jianlong, and Bingsheng He. "An overview of medusa: simplified graph processing on gpus." ACM SIGPLAN Notices 47.8 (2012): 283-284.
Give a ⭐️ if this project helped you!
1KtNLEEeUbTEK9PdN6Ya3ZAKXaqoKUuxCy 0xcD4Db18B6664A9662123D4307B074aE968535388 Ldnz5gMcEeV8BAdsyf8FstWDC6uyYR6pgZ DDUnKpFQbBqLpFVZ9DfuVysBdr249HxVDh TCZxzPZLcJHr2qR3uPUB1tXB6L3FDSSAx7 rN7ZuRG7HDGHR5nof8nu5LrsbmSB61V1qq bnb1zglwcf0ac3d0s2f6ck5kgwvcru4tlctt4p5qef 0xcD4Db18B6664A9662123D4307B074aE968535388 Xd3Yn2qZJ7VE8nbKw2fS98aLxR5M6WUU3sGALPOLPISRHIYHLQER2TLJRGUSZH52RYDK6C3HIU4PSMNAV65Q36EGNL