mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-12 04:18:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Removed test for later

Browse Source
This commit is contained in:
zirtidik 2024-12-03 18:52:31 -05:00
parent 0aa8e1912c
commit eb16b2dfc4
1 changed files with 0 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
graphs/directed_and_undirected_weighted_graph.py
View File

@ -114,20 +114,6 @@ class DirectedGraph:
# c is the count of nodes you want and if you leave it or pass -1 to the function # c is the count of nodes you want and if you leave it or pass -1 to the function
# the count will be random from 10 to 10000 # the count will be random from 10 to 10000
def fill_graph_randomly(self, c=-1): def fill_graph_randomly(self, c=-1):
"""
Fill the graph with random nodes and edges.
Args:
c: Number of nodes to generate. If -1, a random number of nodes between 10 and 10000 is used.
Example:
>>> g = DirectedGraph()
>>> g.fill_graph_randomly(5) # Fill graph with 5 nodes and random edges.
>>> len(g.graph) # Check the number of nodes added.
5
>>> all(isinstance(node, int) and isinstance(edges, list) for node, edges in g.graph.items())
True # All nodes should be integers, and edges should be lists.
"""
if c == -1: if c == -1:
c = floor(random() * 10000) + 10 c = floor(random() * 10000) + 10
for i in range(c): for i in range(c):