# Graph : simple and complex path

Page 1 of 1## 5 Replies - 1611 Views - Last Post: 07 August 2012 - 10:25 AM

### #1

# Graph : simple and complex path

Posted 07 August 2012 - 09:25 AM

let's talk about this graph !

" A path with no repeated vertices is called a simple path "

i want a simple path from A to F

should i access all the vertices or few of them

ADCF <-- i didn't access E

ABCF <-- i didn't access E

ACF <-- i didn't access B,D

^

is that right answer ?

+

what's the defintion of complex path ?

##
**Replies To:** Graph : simple and complex path

### #2

## Re: Graph : simple and complex path

Posted 07 August 2012 - 09:56 AM

Why wouldn't ABCEF be considered a simple path then?

I'm guessing it's a path with repeated vertices.

Quote

what's the defintion of complex path ?

I'm guessing it's a path with repeated vertices.

### #3

## Re: Graph : simple and complex path

Posted 07 August 2012 - 10:05 AM

blackcompe, on 07 August 2012 - 09:56 AM, said:

Why wouldn't ABCEF be considered a simple path then?

I'm guessing it's a path with repeated vertices.

Quote

what's the defintion of complex path ?

I'm guessing it's a path with repeated vertices.

i'm just give a few examples !

one more question :

in simple and complex path should i access all the vertices or few of them ??

### #4

## Re: Graph : simple and complex path

Posted 07 August 2012 - 10:13 AM

A path (simple or complex) does not need to use all vertices. In this graph, all paths from a to f are simple paths.

### #5

## Re: Graph : simple and complex path

Posted 07 August 2012 - 10:15 AM

idaebak, on 07 August 2012 - 07:05 PM, said:

in simple and complex path should i access all the vertices or few of them ??

It doesn't matter. A path without repeating vertices is a simple path no matter how many non-repeating vertices it contains. Likewise a path with repeating vertices is a complex path even if the total number of vertices in it is only 2.

Page 1 of 1