MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / test_add_edge

Method test_add_edge

graphs/graph_adjacency_list.py:434–453  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

432 )
433
434 def test_add_edge(self) -> None:
435 # generate graph input
436 random_vertices: list[int] = random.sample(range(101), 15)
437 random_edges: list[list[int]] = self.__generate_random_edges(random_vertices, 4)
438
439 # build graphs WITHOUT edges
440 undirected_graph = GraphAdjacencyList(
441 vertices=random_vertices, edges=[], directed=False
442 )
443 directed_graph = GraphAdjacencyList(
444 vertices=random_vertices, edges=[], directed=True
445 )
446
447 # run and test add_edge
448 for edge in random_edges:
449 undirected_graph.add_edge(edge[0], edge[1])
450 directed_graph.add_edge(edge[0], edge[1])
451 self.__assert_graph_edge_exists_check(
452 undirected_graph, directed_graph, edge
453 )
454
455 def test_remove_edge(self) -> None:
456 # generate graph input and graphs

Callers

nothing calls this directly

Calls 4

add_edgeMethod · 0.95
GraphAdjacencyListClass · 0.70

Tested by

no test coverage detected