Tries and Suffix Trees implementation

c data-structures trie
AGeek picture AGeek · Jul 22, 2010 · Viewed 12k times · Source

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

Any good example, if included, would be a plus.

Implementation in C.

Answer

Greg S picture Greg S · Jul 22, 2010

The C Algorithms Library (http://fragglet.github.io/c-algorithms/) 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: https://github.com/0xtonyxia/suffix-tree

I hope that helps.

Related questions

Trie implementation

Is there any speed- and cache-efficient implementations of trie in C/C++? I know what a trie is, but I don't want reinvent the wheel, implementing it myself.

Read More
How to reverse a singly linked list using only two pointers?

I wonder if there exists some logic to reverse a singly-linked list using only two pointers. The following is used to reverse the single linked list using three pointers namely p, q, r: struct node { int data; struct node *link; }; …

Read More
How do you implement a circular buffer in C?

I have a need for a fixed-size (selectable at run-time when creating it, not compile-time) circular buffer which can hold objects of any type and it needs to be very high performance. I don't think there will be resource contention …

Read More