MCPcopy Index your code
hub / github.com/TheAlgorithms/Python / test_add_edge

Method test_add_edge

graphs/graph_adjacency_matrix.py:446–465  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

444 )
445
446 def test_add_edge(self) -> None:
447 # generate graph input
448 random_vertices: list[int] = random.sample(range(101), 15)
449 random_edges: list[list[int]] = self.__generate_random_edges(random_vertices, 4)
450
451 # build graphs WITHOUT edges
452 undirected_graph = GraphAdjacencyMatrix(
453 vertices=random_vertices, edges=[], directed=False
454 )
455 directed_graph = GraphAdjacencyMatrix(
456 vertices=random_vertices, edges=[], directed=True
457 )
458
459 # run and test add_edge
460 for edge in random_edges:
461 undirected_graph.add_edge(edge[0], edge[1])
462 directed_graph.add_edge(edge[0], edge[1])
463 self.__assert_graph_edge_exists_check(
464 undirected_graph, directed_graph, edge
465 )
466
467 def test_remove_edge(self) -> None:
468 # generate graph input and graphs

Callers

nothing calls this directly

Calls 4

add_edgeMethod · 0.95

Tested by

no test coverage detected