ernestofgonzalez
/ link_prediction.py
Created
August 3, 2022 22:36
Computing Adamic-Adar index for a specific node in a graph
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 pandas as pd | |
| def main(): | |
| print("Creating graph...") | |
| G = nx.dense_gnm_random_graph(4000, 20000) | |
| print("Created graph: ", G) | |
| print("nodes", list(G)) |
ernestofgonzalez
/ hoshen_kopelman_1d.py
Last active
July 8, 2021 14:07
1D implementation of Hoshen-Kopelman cluster labelling algorithm to identify different trips in a e-scooters data frame
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 random | |
| import pandas as pd | |
| import numpy as np | |
| lock_state = ["locked", "unlocked", "unlocked", "unlocked", "locked", "locked", "unlocked", "unlocked"] | |
| random_values = random.sample(range(2,20), 8) | |
| df = pd.DataFrame( | |
| {'state': lock_state, |