Show / Hide Table of Contents

    Class SuffixTree<T>

    A suffix tree implementation using a trie.

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

    Constructors

    SuffixTree()

    Declaration
    public SuffixTree()

    Properties

    Count

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

    Methods

    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

    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

    GetEnumerator()

    Declaration
    public IEnumerator<T[]> GetEnumerator()
    Returns
    Type Description
    IEnumerator<T[]>

    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

    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[]>
    Back to top Generated by DocFX