Hey..!!

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algo

The line graph L(G) of a simple graph G is defined as follows: · There is exactly one vertex v(e) in L(G) for each edge e in G.· For any two edges e and e' in G, L(G) has an edge between v(e) and

Angles that have common vertex and a common side on a line are classified as

There is a regular octagon A B C D E F G, a Frog is at the vertex A. it can jump on to any of the vertices except the exactly opposite vertex the frog visits all the vertices exactly once and then r

The horizontal distance between two stations P and Q is 100 m. The vertical angles from P and Q to the top of a vertical tower at T are 3o and 5o above horizontal, respectively. The vertical angles fr

A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use

In the ....... traversal we process all of a vertex’s descendants before we move to an adjacent vertex