Re: Best data structure for DFS on large graphs

References	<CACA+676A=G=3+wvaHw3H0LAo2cghztXo4+9ORR73CXBOOpW0ZQ@mail.gmail.com> <jsukoe$aui$1@dough.gmane.org>
Date	2012-07-03 19:09 +0530
Subject	Re: Best data structure for DFS on large graphs
From	Miheer Dewaskar <miheer.dew@gmail.com>
Newsgroups	comp.lang.python
Message-ID	<mailman.1742.1341322787.4697.python-list@python.org> (permalink)

Show all headers | View raw

On Tue, Jul 3, 2012 at 4:53 PM, Stefan Behnel <stefan_ml@behnel.de> wrote:
>
> Miheer Dewaskar, 03.07.2012 13:11:
> > I am not sure,but if there are large number of states Dictionaries wont
> > help much right?
>
> Dicts are fast for lookup, not for searching.
>
What do you mean by searching in the context of Dicts?

> > Anyway, does python have a built-in BST like data-structure ?
>
> It has lists and bisect:
>
> http://docs.python.org/library/bisect.html

But insertion and deletion in a list is o(n):

http://wiki.python.org/moin/TimeComplexity/#list




--
Miheer Dewaskar

Back to comp.lang.python | Previous | Next | Find similar | Unroll thread

Thread

Re: Best data structure for DFS on large graphs Miheer Dewaskar <miheer.dew@gmail.com> - 2012-07-03 19:09 +0530

csiph-web