Class GraphUtils

java.lang.Object
GraphUtils
public class GraphUtils extends Object
Author:
Dr. Lillis

  • Constructor Details

    • GraphUtils

      public GraphUtils()

  • Method Details

    • star6

      public static Graph star6()

    • wheel6

      static Graph wheel6()

    • connected10

      static Graph connected10()

    • disconnected10

      static Graph disconnected10()

    • isolated5

      static Graph isolated5()

    • isolated1

      static Graph isolated1()

    • BFS_DFS_Tree_Test1

      static Graph BFS_DFS_Tree_Test1()
      The graph used for DFS Tree Test 1.

    • DFS_Tree_Test1_SOL

      static Graph DFS_Tree_Test1_SOL()
      Solution to DFS Tree Test 1. This is the tree returned by DFS tree when given the "BFS_DFS_Tree_Test1" and starting at vertex "G"

    • BFS_Tree_Test1_SOL

      static Graph BFS_Tree_Test1_SOL()
      Solution to DFS Tree Test 1. This is the tree returned by DFS tree when given the "BFS_DFS_Tree_Test1" and starting at vertex "G"

    • BFS_DFS_Tree_Test2

      static Graph BFS_DFS_Tree_Test2()
      The graph used for DFS Tree Test 2.

    • DFS_Tree_Test2_SOL

      static Graph DFS_Tree_Test2_SOL()
      Solution to DFS Tree Test 2. This is the tree returned by DFS tree when given the "BFS_DFS_Tree_Test2" and starting at vertex "G"

    • BFS_Tree_Test2_SOL

      static Graph BFS_Tree_Test2_SOL()
      Solution to BFS Tree Test 2. This is the tree returned by BFS tree when given the "BFS_DFS_Tree_Test2" and starting at vertex "G"

    • BFS_DFS_Tree_Test3

      static Graph BFS_DFS_Tree_Test3()
      The graph used for DFS Tree Test 3.

    • DFS_Tree_Test3_SOL

      static Graph DFS_Tree_Test3_SOL()
      Solution to DFS Tree Test 3. This is the tree returned by DFS tree when given the "BFS_DFS_Tree_Test3" and starting at vertex "B". The result is a graph with just one vertex, "B".

    • BFS_Tree_Test3_SOL

      static Graph BFS_Tree_Test3_SOL()
      Solution to BFS Tree Test 3. This is the tree returned by BFS tree when given the "BFS_DFS_Tree_Test3" and starting at vertex "B". The result is a graph with just one vertex, "B".

    • equals

      public static boolean equals(Graph g1, Graph g2)