[Cse321] Re: HW #8, Problem 3 (8.4 #18)

Previous message: Venkatesan Guruswami: "[Cse321] problem set 8"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

venkat@cs.washington.edu

Thanks for the question. For this question, I intended only counting simple
paths (where no edge is repeated). So you can just count and report the
number of simple paths of the specified lengths.

Venkat

----- Original Message ----- 
From: <marcroft@cs.washington.edu>
To: <venkat@cs.washington.edu>
Sent: Sunday, May 30, 2004 8:45 PM
Subject: HW #8, Problem 3 (8.4 #18)

> Venkat,
>
>   I was treating this as the question is written, paths on a simple graph.
I got six paths of length three. [(c,d),(d,c),(c,d)], [(c,d),(d,a),(a,d)],
etc.  Then I considered the larger numbers.  The number of possible paths is
going to get very large indeed.
>   Was it the intent that we list all possible unique paths?  The numbers
would seem to be more reasonable if we limited ourselves to all possible
unique simple paths.
>
> Regards,
> Kyle Marcroft
>
>
>
>
>

_______________________________________________
Cse321 mailing list
Cse321@cs.washington.edu
http://mailman.cs.washington.edu/mailman/listinfo/cse321