Trie树(oversimplified python version)

为了快速地对字符串进行匹配,trie树能够担当此任。以下是用pyhton写的一个简单的例子,凑活能用。

#!/usr/bin/env python

import sys, pickle, re

class TrieNode(object):
    def __init__(self):
        self.value = None
        self.children = {}

class Trie(object):
    def __init__(self):
        self.root = TrieNode()

    def add(self, key):
        node = self.root
        for char in key:
            if char not in node.children:
                child = TrieNode()
                node.children[char] = child
                node = child
            else:
                node = node.children[char]
        node.value = key

    def search(self, key):
        '''return all partially matched strings with the input key'''
        node = self.root
        matches = []
        for char in key:
            if char not in node.children:
                break
            node = node.children[char]
            if node.value:
                matches.append(node.value)
        return matches

def gen_trie(input_file, output_file):
    trie = Trie()
    with open(input_file) as f:
        for line in f:
            line = line.strip()
            trie.add(line)
    with open(output_file, 'wb') as f:
        pickle.dump(trie, f)

if __name__ == '__main__':
    gen_trie('your_key_list', 'output_trie_file')

    原文作者:Trie树
    原文地址: https://blog.csdn.net/psrincsdn/article/details/8158182
    本文转自网络文章,转载此文章仅为分享知识,如有侵权,请联系博主进行删除。
点赞

发表评论

电子邮件地址不会被公开。 必填项已用*标注