debruijn-tp/tests/test_decision.py

"""Tests decision"""
import pytest
import os
import networkx as nx
import statistics
from .context import debruijn
#from .context import debruijn_comp
from debruijn import std
from debruijn import path_average_weight
from debruijn import remove_paths
from debruijn import select_best_path
from debruijn import solve_bubble
from debruijn import simplify_bubbles
from debruijn import solve_entry_tips
from debruijn import solve_out_tips

def test_std():
    assert round(std([9, 5, 15, 20]), 1) == 6.6


def test_path_weight():
    graph = nx.DiGraph()
    graph.add_weighted_edges_from([(1, 2, 5), (3, 2, 10), (2, 4, 10), (4, 5, 3), 
                                   (5, 6, 10), (5, 7, 10)])
    assert path_average_weight(graph, [1, 2, 4, 5] ) == 6.0

def test_remove_paths():
    graph_1 = nx.DiGraph()
    graph_2 = nx.DiGraph()
    graph_3 = nx.DiGraph()
    graph_4 = nx.DiGraph()
    graph_1.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (5, 6), (5, 7)])
    graph_2.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (5, 6), (5, 7)])
    graph_3.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (5, 6), (5, 7)])
    graph_4.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (5, 6), (5, 7)])
    graph_1 = remove_paths(graph_1, [(1,2)], True, False)
    graph_2 = remove_paths(graph_2, [(5,7)], False, True)
    graph_3 = remove_paths(graph_3, [(2,4,5)], False, False)
    graph_4 = remove_paths(graph_4, [(2,4,5)], True, True)
    assert (1,2) not in graph_1.edges()
    assert (3,2) in graph_1.edges()
    assert (5,7) not in graph_2.edges()
    assert (5,6) in graph_2.edges()
    assert 4 not in graph_3.nodes()
    assert (2,4) not in graph_4.edges()
    assert (4, 5) not in graph_4.edges()
    assert 2 not in graph_4.nodes()
    assert 4 not in graph_4.nodes()
    assert 5 not in graph_4.nodes()

def test_select_best_path():
    graph_1 = nx.DiGraph()
    graph_1.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (5, 6), (5, 7)])
    graph_1 = select_best_path(graph_1, [[1,2], [3,2]], [1, 1], [5, 10], delete_entry_node=True)
    assert (1,2) not in graph_1.edges()
    assert (3,2) in graph_1.edges()
    assert 1 not in graph_1.nodes()
    graph_2 = nx.DiGraph()
    graph_2.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (5, 6), (5, 7) , (7, 8)])
    graph_2 = select_best_path(graph_1, [[5, 6], [5, 7, 8]], [1, 2], [13, 10], delete_sink_node=True)
    assert (5,7) not in graph_2.edges()
    assert (7,8) not in graph_2.edges()
    assert (5,6) in graph_2.edges()
    assert 7 not in graph_2.nodes()
    assert 8 not in graph_2.nodes()
    #Select heavier
    graph_3 = nx.DiGraph()
    graph_3.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (2, 8), (8, 9),
                            (9, 5), (5, 6), (5, 7)])
    graph_3 = select_best_path(graph_3, [[2, 4, 5], [2, 8, 9, 5]],
                                         [1, 4], [13, 10])
    assert (2,8) not in graph_3.edges()
    assert (8,9) not in graph_3.edges()
    assert (9,5) not in graph_3.edges()
    assert (2,4) in graph_3.edges()
    assert (4,5) in graph_3.edges()
    assert 8 not in graph_3.nodes()
    assert 9 not in graph_3.nodes()
    assert 2 in graph_3.nodes()
    assert 5 in graph_3.nodes()
    # Select longest
    graph_4 = nx.DiGraph()
    graph_4.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (2, 8), (8, 9), 
                            (9, 5), (5, 6), (5, 7)])
    graph_4 = select_best_path(graph_4, [[2, 4, 5], [2, 8, 9, 5]],
                                         [1, 4], [10, 10])
    assert (2,4) not in graph_4.edges()
    assert (4,5) not in graph_4.edges()
    assert (2,8) in graph_4.edges()
    assert (8,9) in graph_4.edges()
    assert (9,5) in graph_4.edges()
    # Select random
    graph_5 = nx.DiGraph()
    graph_5.add_edges_from([(1, 2), (3, 2), (2, 4), (4, 5), (2, 8), (8, 9),
                            (9, 5), (5, 6), (5, 7)])
    graph_5 = select_best_path(graph_5, [[2, 4, 5], [2, 8, 9, 5]],
                                         [1, 4], [10, 10])

def test_solve_bubble():
    graph_1 = nx.DiGraph()
    graph_1.add_weighted_edges_from([(1, 2, 10), (3, 2, 10), (2, 4, 15), 
                                     (4, 5, 15), (2, 10,10), (10, 5,10),
                                     (2, 8, 3), (8, 9, 3), (9, 5, 3),
                                     (5, 6, 10), (5, 7, 10)])
    graph_1 = solve_bubble(graph_1, 2, 5)
    assert (2,8) not in graph_1.edges()
    assert (8,9) not in graph_1.edges()
    assert (9,5) not in graph_1.edges()
    assert (2,10) not in graph_1.edges()
    assert (10, 5) not in graph_1.edges()
    assert (2,4) in graph_1.edges()
    assert (4,5) in graph_1.edges()
    assert 8 not in graph_1.nodes()
    assert 9 not in graph_1.nodes()
    assert 10 not in graph_1.nodes()
    assert 2 in graph_1.nodes()
    assert 5 in graph_1.nodes()
    graph_2 = nx.DiGraph()
    graph_2.add_weighted_edges_from([(1, 2, 10), (3, 2, 10), (2, 4, 10), 
                                     (4, 5, 10), (2, 10,10), (10, 5,10),
                                     (2, 8, 10), (8, 9, 10), (9, 5, 10),
                                     (5, 6, 10), (5, 7, 10)])
    graph_2 = solve_bubble(graph_2, 2, 5)
    assert (2,4) not in graph_2.edges()
    assert (4,5) not in graph_2.edges()
    assert (2,10) not in graph_1.edges()
    assert (10, 5) not in graph_1.edges()
    assert (2,8) in graph_2.edges()
    assert (8,9) in graph_2.edges()
    assert (9,5) in graph_2.edges()


def test_simplify_bubbles():
    graph_1 = nx.DiGraph()
    graph_1.add_weighted_edges_from([(3, 2, 10), (2, 4, 15), (4, 5, 15),
                                     (2, 10,10), (10, 5,10), (2, 8, 3),
                                     (8, 9, 3), (9, 5, 3), (5, 6, 10),
                                     (5, 7, 10)])
    graph_1 = simplify_bubbles(graph_1)
    assert (2,8) not in graph_1.edges()
    assert (8,9) not in graph_1.edges()
    assert (9,5) not in graph_1.edges()
    assert (2,10) not in graph_1.edges()
    assert (10, 5) not in graph_1.edges()

def test_solve_entry_tips():
    graph_1 = nx.DiGraph()
    graph_1.add_weighted_edges_from([(1, 2, 10), (3, 2, 2), (2, 4, 15), (4, 5, 15)])
    graph_1 = solve_entry_tips(graph_1, [1, 3])  
    assert (3, 2) not in graph_1.edges()
    assert (1, 2) in graph_1.edges()
    graph_2 = nx.DiGraph()
    graph_2.add_weighted_edges_from([(1, 2, 2), (6, 3, 2), (3, 2, 2),
                                     (2, 4, 15), (4, 5, 15)])
    graph_2 = solve_entry_tips(graph_2, [1, 6])  
    assert (1, 2) not in graph_2.edges()
    assert (6, 3) in graph_2.edges()
    assert (3, 2) in graph_2.edges()

def test_solve_out_tips():
    graph_1 = nx.DiGraph()
    graph_1.add_weighted_edges_from([(1, 2, 15), (2, 3, 15), (4, 5, 15), (4, 6, 2)])
    graph_1 = solve_out_tips(graph_1, [5, 6])  
    assert (4, 6) not in graph_1.edges()
    assert (4, 5) in graph_1.edges()  
    graph_2 = nx.DiGraph()
    graph_2.add_weighted_edges_from([(1, 2, 15), (2, 3, 15), (4, 5, 2), (4, 6, 2) , (6, 7, 2)])
    graph_2 = solve_out_tips(graph_2, [5, 7])  
    assert (4, 5) not in graph_2.edges()
    assert (6, 7) in graph_2.edges()