1.What is a simple path?
A path in a diagram in which the edges are distinct is called a simple path. It is also called as edge simple.
2. What is a cycle or a circuit?
A path which originates and ends in the same node is called a cycle or circuit.
3. What is an acyclic graph?
A simple diagram which does not have any cycles is called an acyclic graph.
4. What is meant by strongly connected in a graph?
An undirected graph is connected, if there is a path from every vertex to every other vertex. A directed graph with this property is called strongly connected.
5. When is a graph said to be weakly connected?
When a directed graph is not strongly connected but the underlying graph is connected, then the graph is said to be weakly connected.
6. Name the different ways of representing a graph?
a. Adjacency matrix
b. Adjacency list
7. What is an undirected acyclic graph?
When every edge in an acyclic graph is undirected, it is called an undirected acyclic graph. It is also called as undirected forest.
8. What are the two traversal strategies used in traversing a graph?
a. Breadth first search
b. Depth first search
9. What is a minimum spanning tree?
A minimum spanning tree of an undirected graph G is a tree formed from graph edges that connects all the vertices of G at the lowest total cost.
10. What is NP?
NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.
A path in a diagram in which the edges are distinct is called a simple path. It is also called as edge simple.
2. What is a cycle or a circuit?
A path which originates and ends in the same node is called a cycle or circuit.
3. What is an acyclic graph?
A simple diagram which does not have any cycles is called an acyclic graph.
4. What is meant by strongly connected in a graph?
An undirected graph is connected, if there is a path from every vertex to every other vertex. A directed graph with this property is called strongly connected.
5. When is a graph said to be weakly connected?
When a directed graph is not strongly connected but the underlying graph is connected, then the graph is said to be weakly connected.
6. Name the different ways of representing a graph?
a. Adjacency matrix
b. Adjacency list
7. What is an undirected acyclic graph?
When every edge in an acyclic graph is undirected, it is called an undirected acyclic graph. It is also called as undirected forest.
8. What are the two traversal strategies used in traversing a graph?
a. Breadth first search
b. Depth first search
9. What is a minimum spanning tree?
A minimum spanning tree of an undirected graph G is a tree formed from graph edges that connects all the vertices of G at the lowest total cost.
10. What is NP?
NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.
No comments:
Post a Comment