Graph Algorithms on the Final

[Michael Ndubuisi]

Will we have to know Dijkstra's algorithm for the final exam? This is
covered on some previous finals, but we haven't discussed it in class,
so I was curious.

Thanks.

[Thorsten Joachims]

No.

---
Thorsten Joachims
Associate Professor
Department of Computer Science
Cornell University
http://www.joachims.org/

[Thorsten Joachims]

But, let me add, that the BFS for shortest paths in weighted graphs is part of the material for the final.

[Ryan Kass]

Anyone else having trouble using their V-card?

On May 11, 1:15 pm, Thorsten Joachims <t...@cs.cornell.edu> wrote:
> But, let me add, that the BFS for shortest paths in weighted graphs is part of the material for the final.
>
> ---
> Thorsten Joachims
> Associate Professor
> Department of Computer Science

> Cornell Universityhttp://www.joachims.org/

>  
>
>
>
>
>
>
>
> > -----Original Message-----
> > From: Thorsten Joachims
> > Sent: Wednesday, May 11, 2011 9:29 AM
> > To: cornell-c...@googlegroups.com
> > Cc: Thorsten Joachims
> > Subject: RE: [cs2110-sp11] Graph Algorithms on the Final
>
> > No.
>
> > ---
> > Thorsten Joachims
> > Associate Professor
> > Department of Computer Science
> > Cornell University
> >http://www.joachims.org/
>
> > > -----Original Message-----
> > > From: cornell-c...@googlegroups.com [mailto:cornell-cs2110-
> > > sp...@googlegroups.com] On Behalf Of Michael Ndubuisi
> > > Sent: Wednesday, May 11, 2011 5:29 AM
> > > To: cs2110-sp11
> > > Subject: [cs2110-sp11] Graph Algorithms on the Final
>
> > > Will we have to know Dijkstra's algorithm for the final exam? This is
> > > covered on some previous finals, but we haven't discussed it in class,
> > > so I was curious.
>
> > > Thanks.
>
>
>

>  Thorsten Joachims.vcf
> < 1KViewDownload