User talk:Brona
From Wikipedia, the free encyclopedia
Hello, welcome to Wikipedia. Here are some useful links in case you haven't already found them:
- How to edit a page
- How to write a great article
- Naming conventions
- Manual of Style
- Wikipedia Policies and guidelines
If you made any edits before you got an account, you might be interested in assigning those to your username. If you have any questions, see the help pages, add a question to the village pump or ask me on my talk page. I hope you enjoy editing here and being a Wikipedian!
Tip: you can sign your name with ~~~~
snoyes 04:23, 15 Feb 2004 (UTC)
Hiya. In an edit summary on Dijkstra's algorithm you said "six degrees should be done by BFS, not Dijkstra". I agree with the edit (six degrees shouldn't be linked from a WP article), but I'd be interested to know why you think BFS would be more appropriate than Dijkstra's for this problem (I know very little about graph theory, so any suggestions are welcome :). Thanks ā Kate Turner | Talk 03:24, 2004 Nov 10 (UTC)
- You can use Dijkstra's algorithm for this purpose. However, Breadth-first search (BFS) can also be used to find shortest paths from a given source when all edges have the same weight. It is more efficient and simpler than Dijkstra's algorithm, thus more appropriate. BFS cannot be applied though for graphs with weighted edges. Then you need Dijkstra's algorithm. Article about BFS does not have much detail at this point but you can probably find more info on the web. I hope this helps. Brona 04:27, 10 Nov 2004 (UTC)