November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...nevermind generating *all* nodes). [...] That doesn't solve the problem when graph nodes are generated... | |||
November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...only be 1 or -1. Basically, adjacent nodes differ only in a single coordinate, and... | |||
November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...means your graph is quite sparse, yet nodes are connected ("differ only by a single... | |||
November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...parallel arrays - you store a bit array in parallel with an array of nodes. Andrei | |||
November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...can see, the possible values of the nodes are all the points in N^n... | |||
November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...duplicate detection, to allow the number of nodes to exceed available RAM. What we found... | |||
November 15, 2013 General » Re: [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
[...] There are too many nodes to keep in memory, actually. The algorithm also doesn't... | |||
November 15, 2013 General » [OT] Best algorithm for extremely large hashtable? | |||
|---|---|---|---|
| |||
...data structure to keep track of which nodes have been visited, that (1) allows reasonably... | |||
November 11, 2013 General » Re: DIP 50 - AST macros | |||
|---|---|---|---|
| |||
...But that it would be possible to pass Ast nodes to other functions. -- /Jacob Carlborg | |||
November 11, 2013 General » Re: DIP 50 - AST macros | |||
|---|---|---|---|
| |||
...would be useful but only if some library actually accepted these AST nodes. -- Dmitry Olshansky | |||
Copyright © 1999-2021 by the D Language Foundation