Skip Navigation

The Computer Journal 2000 43(6):482-490; doi:10.1093/comjnl/43.6.482
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Younessi, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Algorithm for Automatic Construction of Class Diagrams

Houman Younessi1

1 Rensselaer Initiative in Software Engineering (RISE), Rensselaer Polytechnic Institute, Rensselaer at Hartford, Hartford, CT 06120, USA Email: houman@rh.edu

Most object-oriented methodologies use a notation set that depicts the class diagram as a graph of nodes representing classes and edges representing relationships between classes. An important activity in the production of these is the determination of the topology of such a graph, i.e. the form of a valid class diagram. It is the purpose of this paper to provide a set of heuristics and their corresponding algorithms to assist in the determination of such graphs. These algorithms may prove to be useful, particularly to novice and intermediately skilled modellers, as well as for automation of the class diagram generation process.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.