{'fraction_non_alphanumeric': 0.020161290322580645, 'fraction_numerical': 0.0013440860215053765, 'mean_word_length': 4.643939393939394, '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}}
[Basics of using the DAG programs].

The application of causal graphs is a useful tool to visualize the relationship between variables and allows the identification of causal and non-causal effects. If the strict rules of the DAG theory are followed, then it is possible to identify confounding and other sources of bias. In this article we show the backtracking algorithm to find all paths of a directed acyclic graph (DAG). The knowledge of the paths can be used to identify systematically all minimally sufficient adjustment sets. The search follows formal rules and can be done by a computer program. The adjacency list and adjacency matrix, which can be used as input for a computer program, are 2 representational forms of a causal graph.