this could possibly be a stupid question but...

A complete graph means that there is a direct route between any 2 nodes/vertices, but what does it mean by direct route?

Question

this could possibly be a stupid question but...

A complete graph means that there is a direct route between any 2 nodes/vertices, but what does it mean by direct route?

apoorvk · Answer

Do you mean 'continuity' by any chance?

amorfide · Answer

this is decision 1 all about algorithms

amorfide · Answer

@apoorvk

apoorvk · Answer

Oops - I have no idea what Decision 1 is all about.

Let me see..

anonymous · Answer

A direct route is a route without intermediate nodes.
So every node is directly connected to every other in a complete graph.
As shown in the picture.
i.e. a triangle is a complete graph. A square is not.

amorfide · Answer

so what is the difference between a complete graph and connected graph?

amorfide · Answer

@eberentzen

apoorvk · Answer

amorfide, check out this link, should help you: http://en.wikipedia.org/wiki/Complete_graph