Content deleted Content added
Line 72:
::: And thanks for pointing out this approach, I would go for this one instead of the reverse index one. --[[User:Kh naba|Naba Kumar]] ([[User talk:Kh naba|talk]]) 19:31, 28 May 2011 (UTC)
::::Re why not to add it to the article: because we need a reliable source that describes this alternative approach. I discussed it eight years ago [http://mail.python.org/pipermail/python-dev/2003-April/035013.html here] but I don't think that counts as a reliable source unless you want to go with the "established expert" clause of [[WP:SPS]] (plausible as I have published about other aspects of shortest paths but I'm certainly not going to add it myself). I don't know of published sources that talk about doing it this way. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 19:51, 28 May 2011 (UTC)
::::: Here's one source with talks about this idea: [http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=standardTemplateLibrary2#dijkstra3]. They further eliminate space disadvantage you mentioned by using a balanced tree (standard in C++) which does everything heaps can do plus an efficient erase operation. -- [[User:X7q|X7q]] ([[User talk:X7q|talk]]) 20:54, 28 May 2011 (UTC)
| |||