You can edit this project here. Please include a reason for your changes. This helps us to validate the changes. The changes will take effect as soon as possible after we have checked their validity.

Graph product line

Short description

Description
Lopez-Herrejon and Batory [2001] developed the Graph Product Line as a bench- mark for product line technology. Similar to the Functional Graph Library, a user can select between weighted and unweighted and between directed and undi- rected edges, between three different underlying data structures (vertex lists, neighbor lists, edge objects), and several algorithms such as depth first search, cycle detection, or Kruskal’s algorithm. The Graph Product Line is interesting as a case study, because it contains many alternative features and nontrivial depen- dencies (e.g., Kruskal’s algorithm requires undirected and weighted edges) and because the domain is well-known. The Graph Product Line was developed from scratch with the feature-oriented language Jak (27 feature modules). We manually wrote a Java implementation that merges all features in a single code base and annotated that implementa- tion. Additionally, we annotated the HTML documentation, so each variant has a documentation that describes only available features.

Generator

Authors

Institution

Language

Development tool

Number of features

Lines of code

Number of classes

Number of products

Repository

Website

License

Reason for change

Email: (not visible)

Initial date

Please type the abbreviation for software product line:

Back