Question: A directed graph (digraph) G = (V, E, L) consists of a set of vertices V = v1, v2, . . . , vn, a
A directed graph (digraph) G = (V, E, L) consists of a set of vertices V = v1, v2, . . . , vn, a set of edge labels L, and a set of directed edges E V x V x L. Suppose you are assigned to design and implement a graph editor, i.e. an editor for drawing and editing a digraph. Construct a domain model including the following: 1.A.) (10 POINTS) Produce a textual description for a graph. The description must describe the elements of a graph such as vertices, edges and relationships between the elements. 1.B.) (10 POINTS) Apply the brainstorming rules to the textual description as described in Section 5.4.2, and present your brainstorming result. 1.C.) (10 POINTS) Classify the brainstorming result you have obtained as described in Section 5.4.3 and present your classification result. 1.D.) (10 POINTS) Convert the classification result into a domain model, i.e. UML class diagram without operations (methods). Please use a UML editor to draw the domain model, no manual drawing. Following is a list of freely available UML editors. Or, you can use another UML editor of your choice.
Sparks Enterprise Architect http://www.sparxsystems.com/. 30 day trial version only.
Violet UML editor http://alexdp.free.fr/violetumleditor/page.php. Very simple features of UML design. Free.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
