(Solved) : Method Supposed Check Graph Bipartite Return Null Isn T Could Please Look Fix Tweak Matche Q37159818 . . .
Below, this method is supposed to check if a graph is bipartiteor not, and then return null if it isn’t. Could you please look atwhat I have and fix/tweak it so that it matches what the directionsin blue say?
Determines whether an undirected graph is bipartite @param g an undirected graplh * @param bipartite is true if g is bipartite, otherwise false * @return an array of size IG|+1. The first entry is |GI and the remaining entries are in 0,1 when g is bipartite where [i]-0 if vertex i *is in the first partition and 1 if it is in the second partition; * if g is not bipartite NULL returned. rivate static boolean isBipartite(Graph<City> g, AtomicBoolean bipartite) throws GraphException boolean [] visitedNodesnew booleanI GraphDemo.size() +1]; String color new String[ GraphDemo.size) +1]; //boolean array. Red-true, Blue-false color [V]-“Red” int layerCounter0; ArrayList<ArrayList<Integer>>layers new ArrayList<ArrayList<Integer>> layers.add (new ArrayList<Integer>)); layers.get(0).add(V); visitedNodes [V-true; //how many layers we find. Used to name the layers. Starts@ 0, but there is actually 1 n //add the 1st layer //add Starting node to the 1st layer //visit that node so it won’t be explored again while( layers.get (layerCounter)isEmpty) //repeat until no more layers exist layers.add (new ArrayList<Integer>)); //create empty layer (makes an extra layer when algorithm terminate, for(int ulayers.get (layerCounter)) for(int v GraphDemo.get(u)) if(!visitedNodes [v])I //for each node in the current layer //for each node with an edge to the node u visitedNodes [v]-true; layers.get(layerCounter+1).add(v); // add to the NEXT layer İf ((1ayerCounter+1 ) %2–0){ //Check next 1ayer, Even layers get Red //If not visited, visit color[v]-“Red”; else //odd layers get Blue color[vl-“Blue” layerCounter++; Show transcribed image text Determines whether an undirected graph is bipartite @param g an undirected graplh * @param bipartite is true if g is bipartite, otherwise false * @return an array of size IG|+1. The first entry is |GI and the remaining entries are in 0,1 when g is bipartite where [i]-0 if vertex i *is in the first partition and 1 if it is in the second partition; * if g is not bipartite NULL returned. rivate static boolean isBipartite(Graph g, AtomicBoolean bipartite) throws GraphException boolean [] visitedNodesnew booleanI GraphDemo.size() +1]; String color new String[ GraphDemo.size) +1]; //boolean array. Red-true, Blue-false color [V]-“Red” int layerCounter0; ArrayListlayers new ArrayList layers.add (new ArrayList)); layers.get(0).add(V); visitedNodes [V-true; //how many layers we find. Used to name the layers. Starts@ 0, but there is actually 1 n //add the 1st layer //add Starting node to the 1st layer //visit that node so it won’t be explored again while( layers.get (layerCounter)isEmpty) //repeat until no more layers exist layers.add (new ArrayList)); //create empty layer (makes an extra layer when algorithm terminate, for(int ulayers.get (layerCounter)) for(int v GraphDemo.get(u)) if(!visitedNodes [v])I //for each node in the current layer //for each node with an edge to the node u visitedNodes [v]-true; layers.get(layerCounter+1).add(v); // add to the NEXT layer İf ((1ayerCounter+1 ) %2–0){ //Check next 1ayer, Even layers get Red //If not visited, visit color[v]-“Red”; else //odd layers get Blue color[vl-“Blue” layerCounter++;
Expert Answer
Answer to Below, this method is supposed to check if a graph is bipartite or not, and then return null if it isn’t. Could you plea…
OR