page 1 out of 3
page 1 out of 3
Question 1
Which of the following is similar to BFS?
Question 2
Which of the following is not a term of graph?
Question 3
Which of the following is True?
Question 4
Which of the following is True?
Question 5
Which of the following can be used to represent a graph?
Question 6
What is the graph in which some path exists between every two vertices (u, v) in V without any isolated nodes.
Question 7
What is the graph in which edges represent a specific path from some vertex A to another vertex B.
Question 8
What is the graph in which each edge is assigned with some data such as length or weight?
Question 9
What is the graph in which every node is connected with all other nodes.
Question 10
How many Edges are there in a complete graph with 6 nodes?
page 1 out of 3
page 1 out of 3