The package contains a parallel and sequential algorithm for generating a large number of special graph classes such as

• Chordal Graphs
• Chordal Bipartite Graphs
• Interval Graphs
• Split Graphs
• Grid Graphs
• Halin Graphs
• Co-graphs

The algorithm is implemented in C++. The set of graphs generated by the algorithm is written into a text file as a set of adjacency matrices. This package can be used to assess the performance of NP-Hard problems through simulation restricted to special graph classes