algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

all valid python 3

Browse Source
This commit is contained in:
Alex Brown
2018-10-20 14:45:08 -05:00
parent b566055e4b
commit ea2ddaaf6a
37 changed files with 76 additions and 1436 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/minimum_spanning_tree_kruskal.py
View File

@@ -1,10 +1,10 @@
from __future__ import print_function
num_nodes, num_edges = list(map(int,raw_input().split()))
num_nodes, num_edges = list(map(int,input().split()))
edges = []
for i in range(num_edges):
node1, node2, cost = list(map(int,raw_input().split()))
node1, node2, cost = list(map(int,input().split()))
edges.append((i,node1,node2,cost))
edges = sorted(edges, key=lambda edge: edge[3])

4
graphs/minimum_spanning_tree_prims.py
View File

@@ -101,8 +101,8 @@ def PrimsAlgorithm(l):
return TreeEdges
# < --------- Prims Algorithm --------- >
n = int(raw_input("Enter number of vertices: "))
e = int(raw_input("Enter number of edges: "))
n = int(input("Enter number of vertices: "))
e = int(input("Enter number of edges: "))
adjlist = defaultdict(list)
for x in range(e):
l = [int(x) for x in input().split()]

4
graphs/scc_kosaraju.py
View File

@@ -1,12 +1,12 @@
from __future__ import print_function
# n - no of nodes, m - no of edges
n, m = list(map(int,raw_input().split()))
n, m = list(map(int,input().split()))
g = [[] for i in range(n)] #graph
r = [[] for i in range(n)] #reversed graph
# input graph data (edges)
for i in range(m):
u, v = list(map(int,raw_input().split()))
u, v = list(map(int,input().split()))
g[u].append(v)
r[v].append(u)