Lesson 2-PART 2

Question 1

a _is a non-linear structure (also
called a network). Unlike a tree or binary tree, a _does not have a root – no primary entry point.

Answer 1

Graphs

Question 2

the interconnected objects are
represented by points.
can be connected to any other node
by an edge. It can have any number of edges and nodes.

Answer 2

Vertices

Question 3

the links that connect the vertices.

Answer 3

Edges

Question 4

a “walk” from one vertex to another along
directed edges

Answer 4

Path

Question 5

the pair of vertices representing any edge in unordered.

Answer 5

Undirected Graphs

Question 6

the pair of vertices representing any edge is ordered.

Answer 6

Directed Graphs

Question 7

each edge (or vertex) of G is assigned a numerical value, or weight.

Answer 7

Weighted Graphs

Question 8

there is no cost distinction between various edges and vertices.

Answer 8

Unweighted Graphs

Question 9

Vertices connected by an edge.

Answer 9

Adjacent Vertices

Question 10

A subset of Graph G, which has all the vertices covered with minimum possible number of edges.

Answer 10

Spanning tree