2IntroductionIn this assignment, I present a data structure for the graph presented in the assignment. I alsodescribe what is an acyclic graph, a directed graph, a connected graph, and a simple graph.Create a data structure that includes both edges and verticesFollowing the data structure provided in the assignment, the following graphCan be implemented using the following data structureV = {1, 2, 3, 4, 5, 6, 7, 8}E = { (1, 2), (1, 3), (2, 3), (2, 4), (3, 5), (4, 7), (5, 4), (5, 6), (6, 7), (7, 8) }Determine if the graph is acyclic or notA cycle in a directed graph is a circular path, i.e., a path in which starting on one vertex and byfollowing that path, we arrive at the same vertex [ CITATION Das06 \l 1033 ]. A directed graphis acyclic if it does not contain cycles and is cyclic if contains at least one cycle.The graph of this assignment is acyclic because it does not contain any cycle.
