What is the technical term for a node in a directed acyclic graph (DAG)?Select one:a.Cycleb.Vertexc.Graphd.Edge

What is a directed acyclic graph (DAG)?Select one:a.A graph in which the edges have a direction and there are no cyclesb.A graph in which the edges do not have a direction and there are cyclesc.A graph in which the edges do not have a direction and there are no cyclesd.A graph in which the edges have a direction and there are cycles

What is an example of a real-world application of directed acyclic graphs (DAGs)?Select one:a.Social media networksb.Data pipelinesc.Computer networksd.All of the above

A graph having an edge from each vertex to every other vertex is called a ___________

Edge which connects a vertex to an ancestor in the DFS tree is termed asa)Forward edgesb)None of the mentionedc)Cross edgesd)Back edges

The below type of Graph is identified as where G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G.OptionsTrivial GraphCyclic GraphNull GraphTranspose Graph