KaneAI - World’s First E2E Software Testing Agent.Book a Demo Join TestMu Conference

How to use create_tour method in SeleniumBase

Best Python code snippet using SeleniumBase

test_unit.py

Source:test_unit.py

2from core.tournament.models import Tour, Match3@pytest.mark.django_db4def test_tournaments(create_tournament, create_tour, create_match, create_player):5    tournament = create_tournament6    tour = create_tour(tournament.id)7    first_player = create_player("first player", "first_player", "email@example.com")8    second_player = create_player(9        "second player", "second_player", "email_1@example.com"10    )11    create_match(tour.id, first_player.id, second_player.id)12    assert tournament.tours_amount == 113    assert tournament.members_amount == 214@pytest.mark.django_db15def test_tournaments_invalid(16    create_tournament, create_tour, create_match, create_player17):18    tournament = create_tournament19    assert tournament.tours_amount == 020    assert tournament.members_amount == 021@pytest.mark.django_db22def test_tour_get_players_ids(23    create_tournament, create_tour, create_match, create_player24):25    tournament = create_tournament26    tour = create_tour(tournament.id)27    first_p = create_player("first player", "first_username", "email@example.com")28    second_p = create_player("second player", "second_username", "email1@example.com")29    create_match(tour.id, first_p.id, second_p.id)30    assert Tour.objects.last().get_players_ids() == {first_p.id, second_p.id}31@pytest.mark.django_db32def test_tour_get_players_points(33    create_tournament, create_tour, create_match, create_player, create_game_fix34):35    tournament = create_tournament36    tour = create_tour(tournament.id)37    first_p = create_player("first player", "first_username", "email@example.com")38    second_p = create_player("second player", "second_username", "email1@example.com")39    match = create_match(tour.id, first_p.id, second_p.id)40    game = create_game_fix((first_p, second_p))41    game.black_player_points = 542    game.white_player_points = 443    game.save()44    match.games.add(game)45    for i in Tour.objects.last().get_players_points():46        if i["username"] == "first player":47            assert i["point"] == 4.048        if i["username"] == "second player":49            assert i["point"] == 5.050@pytest.mark.django_db51def test_match_get_players_point(52    create_tournament, create_tour, create_match, create_player, create_game_fix53):54    tournament = create_tournament55    tour = create_tour(tournament.id)56    first_p = create_player("first player", "first_username", "email@example.com")57    second_p = create_player("second player", "second_username", "email1@example.com")58    match = create_match(tour.id, first_p.id, second_p.id)59    game = create_game_fix((first_p, second_p))60    game.black_player_points = 561    game.white_player_points = 462    game.save()63    match.games.add(game)...

H1_EulerianTourVer1.py

Source:H1_EulerianTourVer1.py

...6# Eulerian Tour Ver 17#8# Write a function, `create_tour` that takes as input a list of nodes9# and outputs a list of tuples representing edges between nodes that have an Eulerian tour.10def create_tour(nodes):11    graph = []12    tuple = (0,0)13    i = 014    j = 015    while i < len(nodes):16        j = 017        while j < len(nodes):18            a = nodes[i]19            b = nodes[j]20            if a != b:21                tuple = (a,b)22                graph.append(tuple)23            j = j + 124        i = i + 125    return graph26#########27def get_degree(tour):28    degree = {}29    for x, y in tour:30        degree[x] = degree.get(x, 0) + 131        degree[y] = degree.get(y, 0) + 132    return degree33def check_edge(t, b, nodes):34    """35    t: tuple representing an edge36    b: origin node37    nodes: set of nodes already visited38    if we can get to a new node from `b` following `t`39    then return that node, else return None40    """41    if t[0] == b:42        if t[1] not in nodes:43            return t[1]44    elif t[1] == b:45        if t[0] not in nodes:46            return t[0]47    return None48def connected_nodes(tour):49    """return the set of nodes reachable from50    the first node in `tour`"""51    a = tour[0][0]52    nodes = set([a])53    explore = set([a])54    while len(explore) > 0:55        # see what other nodes we can reach56        b = explore.pop()57        for t in tour:58            node = check_edge(t, b, nodes)59            if node is None:60                continue61            nodes.add(node)62            explore.add(node)63    return nodes64def is_eulerian_tour(nodes, tour):65    # all nodes must be even degree66    # and every node must be in graph67    degree = get_degree(tour)68    for node in nodes:69        try:70            d = degree[node]71            if d % 2 == 1:72                print "Node %s has odd degree" % node73                return False74        except KeyError:75            print "Node %s was not in your tour" % node76            return False77    connected = connected_nodes(tour)78    if len(connected) == len(nodes):79        return True80    else:81        print "Your graph wasn't connected"82        return False83def test():84    nodes = [20, 21, 22, 23, 24, 25]85    tour = create_tour(nodes)86    return is_eulerian_tour(nodes, tour)87nodes = [20, 21, 22, 23, 24, 25]88#print nodes[1]89#print create_tour(nodes)90#b= 1291#c = 2492#a = (b,c)93#print a...

3.py

Source:3.py

...5# input a list of nodes6# and outputs a list of tuples representing7# edges between nodes that have an Eulerian tour.8#9def create_tour(nodes):10    # your code here11    return []12#########13def get_degree(tour):14    degree = {}15    for x, y in tour:16        degree[x] = degree.get(x, 0) + 117        degree[y] = degree.get(y, 0) + 118    return degree19def check_edge(t, b, nodes):20    """21    t: tuple representing an edge22    b: origin node23    nodes: set of nodes already visited24    if we can get to a new node from `b` following `t`25    then return that node, else return None26    """27    if t[0] == b:28        if t[1] not in nodes:29            return t[1]30    elif t[1] == b:31        if t[0] not in nodes:32            return t[0]33    return None34def connected_nodes(tour):35    """return the set of nodes reachable from36    the first node in `tour`"""37    a = tour[0][0]38    nodes = set([a])39    explore = set([a])40    while len(explore) > 0:41        # see what other nodes we can reach42        b = explore.pop()43        for t in tour:44            node = check_edge(t, b, nodes)45            if node is None:46                continue47            nodes.add(node)48            explore.add(node)49    return nodes50def is_eulerian_tour(nodes, tour):51    # all nodes must be even degree52    # and every node must be in graph53    degree = get_degree(tour)54    for node in nodes:55        try:56            d = degree[node]57            if d % 2 == 1:58                print "Node %s has odd degree" % node59                return False60        except KeyError:61            print "Node %s was not in your tour" % node62            return False63    connected = connected_nodes(tour)64    if len(connected) == len(nodes):65        return True66    else:67        print "Your graph wasn't connected"68        return False69def test():70    nodes = [20, 21, 22, 23, 24, 25]71    tour = create_tour(nodes)...

Automation Testing Tutorials

Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.