# Talk:Shortest Path

## Article Outline?[edit]

I am thinking about writing this entry. I think the important things to cover are

single source shortest path in unweighted graph (bfs)

single source shortest path in weighted graph (dijkstra)

all pairs shortest paths (floyd's)

Should they all be described on this page? Should this page link to a page for each specific algorithm? --Rrenaud 21:48, 25 Jan 2005 (EST)

There should probably be descriptions (relatively detailed ones) about each of them, but definitely links as well. Probably leave the pseudo-code out, but at least discuss the techniques used and stuff.. hope this answers your question..

Larry 21:55, 25 Jan 2005 (EST)

don't forget the bellman-ford for graphs with negative edges --Misof 02:12, 27 Jan 2005 (EST)

Why no pseudo-code? BTW, feel free to write up bellman-ford Misof, I've never actually implemented it myself :( --Rrenaud 02:27, 27 Jan 2005 (EST)

Just to keep it relatively terse and concise.. the logic is if someone's interested, he/she would click on the algorithm anyhow.. Larry 07:06, 27 Jan 2005 (EST)