Method isEmpty

Graphs/dijkstra_algorithm.py:18–19 · view source on GitHub ↗

(self)

Source from the content-addressed store, hash-verified

16	self.pos = {} # To store the pos of node in array
17
18	def isEmpty(self):
19	return self.cur_size == 0
20
21	def min_heapify(self, idx):
22	lc = self.left(idx)

dijkstraMethod · 0.95

no outgoing calls

no test coverage detected