# test input file for graph_sampler
# directed acyclic graph generation with 30 node, basic edge prior
# =========================================================================

n_runs    = 2E5;
n_burn_in = 1E4;

random_generator = mersenne_twister;

random_seed = 49740;

n_nodes = 30;

bayesian_network = true;

initial_adjacency = matrix {empty};

hyper_pB = matrix {equanimous};

save_chain = true;
n_saved_adjacency = 10;
save_best_graph = true;  
save_edge_probabilies = true;
save_degree_counts = true;
save_motifs_probabilies = true;

# End.
