Content deleted Content added
AlexandreZ (talk | contribs) →Undirected Graphs: new section |
→Undirected Graphs: ''Undirected'' just a special case. IMO, discussion of this (constant factor) optimization is not needed. |
||
Line 124:
Weighted undirected graphs are equally capable of being solved by the Floyd-Warshall algorithm though some small changes are needed to gain further optimization. I've made the changes to have the article reflect that fact. [[User:AlexandreZ|AlexandreZ]] ([[User talk:AlexandreZ|talk]]) 16:13, 23 March 2010 (UTC)
: ''Undirected'' graphs are essentially a special case for ''directed'' graphs, especially sine F-W works only with the incidence matrix. You're right that one can optimize away half of the comparisons if you know beforehand that the graph is undirected. However, I think that this detail is not needed, nor is that optimization commonly used. <b><font color="green">Jwesley</font>[[User_talk:Jwesley78|<sub>78</sub>]]</b> 17:03, 23 March 2010 (UTC)
| |||