This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| curl -s https://packagecloud.io/install/repositories/github/git-lfs/script.deb.sh | sudo bash | |
| sudo apt-get install git-lfs | |
| git lfs install |
detkov
/ random_graph_generation.py
Last active
November 3, 2020 14:15
These functions allow you to generate random undirected (un)weighted graph without loops with specified number of vertices (nodes) and edges. Also it has a function converting adjacency matrix to adjacency list and adjacency list to edges list. Under the hood it is optimized with the usage of numpy arrays.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import networkx as nx | |
| import numpy as np | |
| import matplotlib.pyplot as plt | |
| from typing import List, Tuple, Union | |
| def create_random_adjacency_matrix(V: int, E: int, weighted: bool = False, | |
| min_: float = 1., max_: float = 10.) -> np.ndarray: |