{'fraction_non_alphanumeric': 0.010174418604651164, 'fraction_numerical': 0.0, 'mean_word_length': 5.043859649122807, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Online algorithms for maintaining the topological order of a directed acyclic graph

We consider the issue of maintaining the topological order for a directed graph in the presence of edge insertions and deletions. We present a new algorithm and provide empirical data on random graphs comparing it with two existing solutions. In addition, we obtain a marginally improved bounded complexity result over the previously known . The results show our algorithm to perform better than the rest in all situations except very dense graphs. This we attribute to its simplicity and good theoretical complexity. Our motivation for this work arises from efforts to build efficient pointer analyses.