- Modify the design and implementation of the Graph, Edge, and GraphNode classes to make them more elegant, if possible. (But do not replace them with a completely different set of classes.) Justify your modifications.
- A graph is bipartite (or two-colorable) if the set of nodes can be partitioned into two sets so that each edge goes from a node in one set to a node in the other set. Equivalently, a graph is bipartite if the nodes can be colored using only two colors so that the nodes on the ends of each edge are opposite colors. The easiest way to determine whether a graph is bipartite is to traverse the graph, coloring the nodes alternate colors as you go. If you encounter an already-colored node that is the wrong color, the graph is not bipartite. Otherwise, it is bipartite. As you are traversing the graph, there are at least 3 ways to keep track of the colors of the nodes:
- add a Color field to the GraphNode class
- add a Map<GraphNode,Color> field to the Graph class that, for each node, stores its color.
- add two fields to the Graph class of type Set<GraphNode>. One field stores the blue nodes and the other stores the red nodes.
- new files needed to be created,
- existing files needed to be modified and
- places existing files needed to be modified.
public int cost() {
int total = 0;
for(int i = 0; i < purchases.size(); i++) {
Purchase p = (Purchase) purchases.get(i);
total += p.item().cost() + p.shipping().cost();
}
return total;
}
Also, suppose the Cart’s maxDays() method is implemented as follows:
public int maxDays() {
int max = 0;
for(int i = 0; i < purchases.size(); i++) {
Purchase p = (Purchase) purchases.get(i);
max = Math.max(max, p.shipping().days());
}
return max;
}
Refactor this design to make it more elegant. You are welcome to add/remove classes and methods if it is helpful. Briefly explain why your design is more elegant.import java.util.ArrayList;
public class BookLibrary {
private ArrayList myBooks = new ArrayList();
public void rename(String oldName, String newName) {
//loop thru array to find the book to be renamed
Book aBook = null;
for( int i = 0; i < myBooks.size(); i++ ) {
Book tempBook = (Book) myBooks.get(i);
if( tempBook.getName().equals(oldName)) {
aBook = tempBook;
break;
}
}
//rename the book if match was found in array
if(aBook == null) return;
aBook.setName(newName);
}
...other methods and instance variables...
}
class Book
{
private String name;
public String getName() { return name; }
public void setName(String newName) { name = newName; }
...other methods and instance variables...
}
- Refactor the code to try to get rid of the bad features.
- Start over from scratch, incorporating all the lessons learned from the previous version.
- An arbitrary number of schools can compete.
- There can be an arbitrary number of teams from each school.
- A team consists of 6 people.
- There are women's teams, men's teams, and mixed teams.
- For each event, there are one or more judges, a scorekeeper, and timers.
- All events in the competition are either individual (one-person) events, two-person events, three-person events, or team (six-person) events.
- Each competition can vary in terms of which events are included. For example, one competition may include tobacco spitting as one of the individual events whereas another competition may have axe juggling instead.
- Each competitor competes in one individual event, one pair event, one three-person event, and one team event.
- Each event is scored differently, including different kinds of penalties. Also, for some events the winner is the one with the lowest score (e.g., the quickest team building a fire) and in other events the winner is the one with the highest score (e.g., the team that spits tobacco the farthest). All scores are ultimately converted to a number between 0 and 100 (100 being best).
- The program needs to determine overall rankings of male teams and female teams separately, based on the total score on all events in which the team participated. The mixed-gender teams are grouped with the male teams. Awards are presented to the top male team and top female team.
- The program also needs to determine rankings of all teams in each event since there will be an award for the winner of each event.
In an actual competition, the user of the program would start up the program and then enter all the information about the events, teams, and players through some GUI. Then, as the competition progressed, the user would use the GUI to enter the data gathered for each event (e.g., the time or distance for each team, any penalties, etc.). When the competition ended, the final scores would be computed from the data and then the scores and rankings of all teams in all events would be displayed.
Design the underlying model and ignore the GUI. Create UML diagrams, including methods and fields, as appropriate. You don't need to implement anything, but implementing parts of it may help you see faults in your design.
The easier it is for me to understand your design, the more points you'll get, so you might want to include some explanations as to why you made particular decisions regarding various parts of the overall design.
Treat me as the customer who is paying you to develop the software and so ask me for any clarifications you need in order to finish your design. As usual, I will share the clarifications with everyone, if appropriate.