# Directed Graph Graph E Set Objects Called Vertices Nodes Connected Together Edges Directed Q17797052

A directed graph is graph, i.e.. a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another. In contrast, a graph where the edges are bidirectional is called an undirected graph. A graph can be formally define as G = (N.E) consisting of the set N of nodes and the set E of edges, which are ordered pairs of elements of N. It is further assumed in this project specification that any graph is finite with no directed or undirected cycles. An example is given below for directed graph. V = {1, 2, 3, 4, 5, 6} E = {(1, 2), (1, 4), (2, 3), (2, 4), (2, 5), (3, 4), (5, 3), (6, 3), (6, 5)} A graph has many useful applications in the real world, such as scheduling of tasks; network topology; family tree; data compression: literature citation, social connections and soon. This project requires you to develop object oriented programs of a graph that can achieve the following functions. A graph can be empty with no vertex or edge. A graph can be either a directed graph or an undirected graph. A graph can be added in vertices and edges. A vertex of a graph can contain values – in theory, the values can be of any type. A graph can be displayed by listing all the possible paths, each linking vertices. A graph can be queried by given a starting vertex, listing the path this vertex leads. A graph can be queried by given an edge, if this edge exists in the graph A graph can be queried if a value is contained by any of its vertex.Show transcribed image text A directed graph is graph, i.e.. a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another. In contrast, a graph where the edges are bidirectional is called an undirected graph. A graph can be formally define as G = (N.E) consisting of the set N of nodes and the set E of edges, which are ordered pairs of elements of N. It is further assumed in this project specification that any graph is finite with no directed or undirected cycles. An example is given below for directed graph. V = {1, 2, 3, 4, 5, 6} E = {(1, 2), (1, 4), (2, 3), (2, 4), (2, 5), (3, 4), (5, 3), (6, 3), (6, 5)} A graph has many useful applications in the real world, such as scheduling of tasks; network topology; family tree; data compression: literature citation, social connections and soon. This project requires you to develop object oriented programs of a graph that can achieve the following functions. A graph can be empty with no vertex or edge. A graph can be either a directed graph or an undirected graph. A graph can be added in vertices and edges. A vertex of a graph can contain values – in theory, the values can be of any type. A graph can be displayed by listing all the possible paths, each linking vertices. A graph can be queried by given a starting vertex, listing the path this vertex leads. A graph can be queried by given an edge, if this edge exists in the graph A graph can be queried if a value is contained by any of its vertex.