tags:

views:

83

answers:

1
+1  Q: 

Tries and Suffix Trees implementation......

Hi,

I have studied Tries and Suffix Trees and wanted to implement the same.... Please share some weblinks where in i can get an idea about the structure and basic idea of implementation to start with.......

Any good examplee, if included... would be a pluss...

Implementation in C.......

Thankss..

+2  A: 

The C Algorithms Library (http://c-algorithms.sourceforge.net/) offers a Trie implementation in C. It's open-source with a BSD-style license.

A suffix tree implementation in C can be found here: http://mila.cs.technion.ac.il/~yona/suffix_tree/

I hope that helps.

Greg S  2010-07-22 10:23:43

related questions

any good tool for makefile generation?
How do you pass a function as a parameter in C?
Where should a veteran C programmer start in order to master Java ?
Any good book on best practice and guidelines in developing a SDK in C?
How do you determine the size of a file in C?
Decoding printf statements in C (Printf Primer)
Shift operator in C
How to avoid redefining VERSION, PACKAGE, etc.
Alpha blending sprites in Nintendo DS Homebrew
When should I use type abstraction in embedded systems
How to implement continuations?
What are the barriers to understanding pointers and what can be done to overcome them?
Anyone have experience creating a shared library in MATLAB?
String.indexOf function in C
Passing multidimensional arrays as function arguments in C
C/C++ library for reading MIDI signals from a USB MIDI device
Choosing a static code analysis tool
How do you printf an unsigned long long int?
Good STL-like library for C.
Rockbox audio format
Why am I getting a malloc: double free error with realloc()?
Should I learn C?
GTK implementation of MessageBox
Is gettimeofday() guaranteed to be of microsecond resolution?
How to use the C socket API in C++ on z/OS