-
as seen on Stack Overflow
- Search for 'Stack Overflow'
What are some clever (not ordinary) ways of implementing data structures in C, and what are some data structures that should be used more often?
For example, what is the most effective way (generating minimal overhead) to implement a directed and cyclic graph with weighted edges in C?
I know that…
>>> More
-
as seen on Programmers
- Search for 'Programmers'
When we design applications, we generally end up with the same tiered sets of data structures:
A persistent data structure that is described using DDL and implemented as RDBMS tables and columns.
A set of domain objects that consist primarily of data structures, usually combined with business-rule…
>>> More
-
as seen on Programmers
- Search for 'Programmers'
I am a newbie into the corporate world recently graduated in computers. I am a java/groovy developer. I am a quick learner and I can learn new frameworks, APIs or even programming languages within considerably short amount of time. Albeit that, I must confess that I was not so strong in data structures…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
I have to design a data structure that is to be used in a multi-threaded environment. The basic API is simple: insert element, remove element, retrieve element, check that element exists. The structure's implementation uses implicit locking to guarantee the atomicity of a single API call.…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
There is a large stream of numbers coming in such as 5 6 7 2 3 1 2 3 .. What kind of data structure is suitable for this problem given the constraints that elements must be inserted in descending order and duplicates should be eliminated.
I am not looking for any code just ideas? I was thinking…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm attempting to implement a Patricia Trie with the methods addWord(), isWord(), and isPrefix() as a means to store a large dictionary of words for quick retrieval (including prefix search). I've read up on the concepts but they just aren't clarifying into an implementation. I want to know (in Java…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello everyone,
Which one is the structure that provides best performance results? Trie, Suffix Tree or Suffix Array? There are other equivalent structures?
What are good Java implementations of these structures?
Thanks for your answers.
Best Regards,
ukrania
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have a trie which I am using to do some string processing. I have a simple compiler which generates trie from some data. Once generated, my trie won't change at run time.
I am looking for an approach where I can persist the trie in a file and load it effectively. I have looked at sqllite to understand…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I want to write an iterator for my 'toy' Trie implementation.
Adding already works like this:
class Trie:
def __init__(self):
self.root = dict()
pass
def add(self, string, value):
global nops
current_dict = self.root
for letter in s:
nops…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm trying to put all words in a trie in a string, a word is detonated by the eow field being true for a certain character in the trie data structure, hence a trie can could have letters than lead up to no word, for ex "abc" is in the trie but "c"'s eow field is false so "abc" is not a word
Here…
>>> More
