Write a Graph class in Java. This class should represent undirected graphs. You can choose one of the representations from our graph exercises, eg object model, sets of nodes and edges, adjacency matrix, or so on, whichever you feel most comfortable with. ● Include comments in your Java file to explain how nodes and edges are represented. ● Assume that only one edge can exist between two nodes. ● Assume that it is possible to have an edge connecting a node to itself, ie that a node
Write a Graph class in Java.
This class should represent undirected graphs. You can choose one of the representations
from our graph exercises, eg object model, sets of nodes and edges, adjacency matrix, or so
on, whichever you feel most comfortable with.
● Include comments in your Java file to explain how nodes and edges are represented.
● Assume that only one edge can exist between two nodes.
● Assume that it is possible to have an edge connecting a node to itself, ie that a node
can be connected to itself via an edge.
● Because edges are undirected, an edge between v and w is also one between w and v.
● Your constructor method should take one parameter: the number of nodes of the
graph.
Add a method to your class: boolean addEdge that takes two parameters, v and
w (representing two modes v and w which are connected together by the edge
being added).
If successful, the method should return true. The method should return false when it is
unsuccessful, which is in the following cases: the edge is already in the graph, or it is an edge
from or to a non existent node.
3. Add a method to your class: boolean addMultipleEdges(int x) which adds to
your graph a total of x new randomly generated edges.
The method should return true if x edges could be successfully added. The method should
return false when it is unsuccessful, which is when x edges could not be added (if there is not
enough space to add x edges. )
Add comments to your representation of edges in the Graph class.
This comment should tell us how you would change your code, if you were being asked to
represent a directed graph rather than an undirected graph. You should not make these
changes in your code, just tell us what changes you would make.
Your answer must include:
a. Changes you would make to how you represent edges (or if you would make no
changes, then state that you would make no changes to this representation)
b. Changes you would make to your addEdge method (or if you would make no
changes, then state that you would make no changes to this method)
c. Changes you would make to your addMultipleEdges method (or if you would make
no changes, then state that you would make no changes to this method)
Add a method to your class: boolean checkBipartite() that checks if a graph
could be converted into a bipartite graph.
This method should return true if the existing nodes and edges of the graph allow for the
graph to be considered a valid bipartite graph. If it is not possible to divide all nodes into two sets such
that edges only connect nodes of different types, then return false.
*SUBMIT SCREENSHOT OF OUTPUT AS WELL*
Step by step
Solved in 3 steps with 1 images
