Class SuffixTree<T>

A suffix tree implementation using a trie.

Inheritance
Object
SuffixTree<T>
Implements
Inherited Members
Namespace: Advanced.Algorithms.DataStructures
Assembly: Advanced.Algorithms.dll
Syntax
public class SuffixTree<T> : IEnumerable<T[]>, IEnumerable
Type Parameters
Name Description
T

Constructors

| Improve this Doc View Source

SuffixTree()

Declaration
public SuffixTree()

Properties

| Improve this Doc View Source

Count

Declaration
public int Count { get; }
Property Value
Type Description
Int32

Methods

| Improve this Doc View Source

Contains(T[])

Returns true if the given entry pattern is in this suffix tree. Time complexity: O(e) where e is the length of the given entry.

Declaration
public bool Contains(T[] pattern)
Parameters
Type Name Description
T[] pattern
Returns
Type Description
Boolean
| Improve this Doc View Source

Delete(T[])

Deletes an existing entry from this suffix tree. Time complexity: O(m^2) where m is the length of entry array.

Declaration
public void Delete(T[] entry)
Parameters
Type Name Description
T[] entry
| Improve this Doc View Source

GetEnumerator()

Declaration
public IEnumerator<T[]> GetEnumerator()
Returns
Type Description
IEnumerator<T[]>
| Improve this Doc View Source

Insert(T[])

Insert a new entry to this suffix tree. Time complexity: O(m^2) where m is the length of entry array.

Declaration
public void Insert(T[] entry)
Parameters
Type Name Description
T[] entry
| Improve this Doc View Source

StartsWith(T[])

Returns all sub-entries that starts with this search pattern. Time complexity: O(rm) where r is the number of results and m is the average length of each entry.

Declaration
public List<T[]> StartsWith(T[] pattern)
Parameters
Type Name Description
T[] pattern
Returns
Type Description
List<T[]>

Explicit Interface Implementations

| Improve this Doc View Source

IEnumerable.GetEnumerator()

Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Type Description
IEnumerator

Implements