Hey..!!

- Level 0
- 0 %

Accuracy -

share

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

Consider the following properties :1. The sum of the three sides is always greater than the circumference of the great circle.2. The sum of the three angles is less than six right angles and greater t

Consider the following statements relating to hydraulic gradient line and energy gradient line1. In the case of a fluid flowing in a pipeline, hydraulic gradient line and energy gradient line may coin

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

class Bar { } class Test { Bar doBar() { Bar b = new Bar(); /* Line 6 */ return b; /* Line 7 */ } public static void main (String args[]) { Test t = new Test(); /* Line 11 */ Bar newBa

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

A directed graph is .................if there is a path from each vertex to every other vertex in the digraph