Shubham Singh shubham-singh-ss

## Dataset1.py
df = pd.read_csv(r"train.csv")
df.head()

## libraries.py
import json
import os
import numpy as np
import tensorflow as tf
import model, sample, encoder

## graph1.py
import matplotlib.pyplot as plt
%matplotlib inline
plt.figure(figsize=(12,8))
nx.draw_networkx(df, with_labels=True)

## kruskal.py
from networkx.algorithms import tree
minspantree = tree.minimum_spanning_edges(df, algorithm='kruskal', data=False)
elist = list(minspantree)
sorted(sorted(e) for e in elist)

## prims.py
from networkx.algorithms import tree
minspantree = tree.minimum_spanning_edges(df, algorithm='prim', data=False)
elist = list(minspantree)
sorted(sorted(e) for e in elist)

## betweenness.py
nx.betweenness_centrality(df)

## degree.py
nx.degree_centrality(df)

## closeness.py
nx.closeness_centrality(df)

## pagerank.py
pr = nx.pagerank(df, alpha=0.9)
pr

## dijkstra.py
shortest_path_distance = nx.dijkstra_path(df, source='AMA', target='PBI', weight='Distance')
shortest_path_distance
	import json
	import os
	import numpy as np
	import tensorflow as tf
	import model, sample, encoder
	import matplotlib.pyplot as plt
	%matplotlib inline
	plt.figure(figsize=(12,8))
	nx.draw_networkx(df, with_labels=True)
	from networkx.algorithms import tree
	minspantree = tree.minimum_spanning_edges(df, algorithm='kruskal', data=False)
	elist = list(minspantree)
	sorted(sorted(e) for e in elist)
	shortest_path_distance = nx.dijkstra_path(df, source='AMA', target='PBI', weight='Distance')
	shortest_path_distance