Chapter 28, Problem 28.3PE

Program Plan Intro

Implement DFS using stack

Program Plan:

Exercise.java:

• Import the required packages.
• Create a class “Exercise”:
  • Define the main method
    • Define and declare the vertices.
    • Define and declare the edges.
    • New graph gets created.
    • Perform depth first search on the list.
    • Display the number of vertices present in the graph.
    • Loop that iterates to find the search orders.
    • Loop that iterates to display the parent node.
• Define and create the class “UnweightedGraphWithNonrecursiveDFS”
  • Create a new constructor.
  • New graph gets using the constructor.
  • Method to create “cloneEdges” gets created.
    • New list gets created.
    • Loop that iterates to add the edges into the list.
    • Loop that iterates to add the neighbor edge into the list.
    • Neighbor copy gets created.
    • Return the neighbor copy.
  • Method to perform “searchTreedfs” is created
    • New list gets created.
    • Loop that iterates and defines the parent node.
    • New stack gets created.
    • Loop that validates the stack is empty or not.
    • Condition to validate the neighbor node gets created.
    • Validate and add the node into the list.
    • Determine the visited and unvisited node.
    • New search tree is returned.

UnweightedGraph.java:

• Import the required packages.
• Create a class “UnweightedGraph”:
  • New list for the vertices gets created.
  • New list for the neighbor node gets created.
  • Create an empty constructor.
  • Method to create new graph gets created and adjacency list gets created.
  • Method to create an adjacency list gets created.
  • Method to return the size of the vertices.
  • Method to return the index of the vertices gets defined.
  • Method to gets the neighbor node gets defined.
  • Method to return the degree of the vertices gets created.
  • Method to print the Edges gets created.
  • New to clear the graph gets created.
  • Method to add vertex gets created.
  • Method to add edge gets created.
  • Method to perform the depth first search gets defined.
  • Method to perform breadth first search gets defined.
    • Search tree gets returned.
• Create a class “SearchTree”
  • Define the method to return the root.
  • Method to return the parent of the vertices
  • Method to return the search order gets defined.
  • Method to return the number of vertices found gets defined.
  • Method to get the path of the vertices gets defined.
    • Loop to validate the path gets defined.
    • Path gets returned.
  • Method to print the path gets defined.
  • Method to print the tree gets defined.
    • Display the edge.
    • Display the root.
    • Condition to validate the parent node to display the vertices gets created.

Graph.java:

• A graph interface gets created.
• Method to return the size gets defined.
• Method to return the vertices gets defined.
• Method to return the index gets created.
• Method to get the neighbor node gets created.
• Method to get the degree gets created.
• Method to print the edges.
• Method to clear the node gets created.
• Method to add the edges, add vertex gets created.
• Method to remove the vertices gets defined.
• Method for the depth first search gets defined.
• Method for the breadth first search gets defined.

Edge.java

• Create a class “Edge”,
  • Define and declare the required variables.
  • Constructor gets defined.
  • Method that defines Boolean objects gets defined.
    • Return the value after validating the vertices.