karims

karims / tests.py

Created May 22, 2020 19:05

	from collections import Counter
	import heapq

	class Elements():
	def __init__(self, key: int, val: int):
	super().__init__()
	self.key = key
	self.val = val
	def __repr__(self):
	return f'Key: {self.key}, Val: {self.val}'

karims / testml.js

Created September 11, 2019 06:50

	function doOnCurrentPageChanged(survey) {
	document
	.getElementById('surveyPrev')
	.style
	.display = !survey.isFirstPage
	? "inline"
	: "none";
	document
	.getElementById('surveyNext')
	.style

karims / gist:cfdbc72120923432684bcd7e3666669f

Created May 25, 2019 12:36

adj


	# Assume all vertices are serial integers from 0 to V
	V = 10

	# Create Adjacency matrix. Fill all elements with zeros
	# **Remember Adjacency matrix is just a 2D array
	adj_matrix = [[0 for _ in range(V)] for _ in range(V)]

	# Lets bring in edges. They are a list with first element pointing to second
	edges = [[0,5], [1,2], [1,4], [1,5], [2,6], [3,7], [4,9]]

karims / adj_matrix.py

Last active May 25, 2019 12:46

Create adjacency matrix

	# Set no. of vertices. Assume all vertices are serial integers from 0 to V
	V = 10

	# Create Adjacency matrix. Fill all elements with zeros
	# **Remember Adjacency matrix is just a 2D array
	adj_matrix = [[0 for _ in range(V)] for _ in range(V)]

	# Lets bring in edges. They are a list with first element pointing to second
	edges = [[0,5], [1,2], [1,4], [1,5], [2,6], [3,7], [4,9]]