Version 0.5

• TSV format added #28
• Multigraph control added #11
• branch_gen function modified
• Website changed to https://www.pyrgg.ir

Version 0.4

• Self loop control added #10
• Github action added #25
• appveyor.yml updated

Version 0.3

• __version__ variable added
• CHANGELOG.md added
• dev-requirements.txt added #5
• requirements.txt added #5
• CODE_OF_CONDUCT.md added
• ISSUE_TEMPLATE.md added
• PULL_REQUEST_TEMPLATE.md added
• CONTRIBUTING.md added
• version_check.py added
• pyrgg_profile.py added
• Unweighted graph support added #8
• Undirected graph support added #9
• Exe version added
• Test system modified #6
• README.md modified
• Docstrings modified
• get_input function modified #12
• edge_gen function modified #12
• Parameters moved to params.py

Version 0.2

Version 0.2

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.

Graph Specifications :

• Weighted
• Signed
• Self Loop
• Parallel Arc
• Sparse
• Dense

Supported Formats:

• DIMACS(.gr)
• CSV(.csv)
• JSON(.json)
• YAML(.yaml)
• Weighted Edge List(.wel)
• ASP(.lp)
• Trivial Graph Format(.tgf)
• UCINET DL Format(.dl)
• Pickle(.p)

JOSS paper accepted : http://dx.doi.org/10.21105/joss.00331

Version 0.1

Pyrgg is an easy to use synthetic random graph generator based on DIMACS/JSON formats written in python
this software generate input files for graph processing applications.

Pyrgg can generate graphs with this specs :

• Weighted
• Signed
• Self Loop
• Parallel Arc
• Sparse
• Dense

This application get :

• vertices number
• max weight
• min weight
• max edge number(for each vertex)
• min edge number(for each vertex)

and generate graph in flat file format (*.gr) and JSON.