Add InterviewCake.com examples
Adds some of the code I generated while studying for a role transfer at Google using the fantastic resource, InterviewCake.com. This work predates the mono-repo. I should think of ways to DRY up this code and the code in crack_the_coding_interview, but I'm afraid I'm creating unnecessary work for myself that way.
This commit is contained in:
parent
b4ee283b23
commit
d4d8397e5f
52 changed files with 3737 additions and 0 deletions
31
data_structures_and_algorithms/topo-sort.py
Normal file
31
data_structures_and_algorithms/topo-sort.py
Normal file
|
|
@ -0,0 +1,31 @@
|
|||
from fixtures import unweighted_digraph
|
||||
from collections import deque
|
||||
|
||||
# vertices_no_in_edges :: UnweightedDigraph -> Set(Vertex)
|
||||
def vertices_no_in_edges(g):
|
||||
"""Return the vertices in graph `g` with no in-edges."""
|
||||
result = set()
|
||||
vertices = set(g.keys())
|
||||
for neighbors in g.values():
|
||||
result = result.union(neighbors)
|
||||
return vertices ^ result
|
||||
|
||||
# topo_sort :: UnweightedDigraph -> List(Vertex)
|
||||
def topo_sort(g):
|
||||
q = deque()
|
||||
seen = set()
|
||||
result = []
|
||||
for x in vertices_no_in_edges(g):
|
||||
q.append(x)
|
||||
while q:
|
||||
vertex = q.popleft()
|
||||
if vertex in seen:
|
||||
continue
|
||||
result.append(vertex)
|
||||
neighbors = g.get(vertex)
|
||||
for x in g.get(vertex):
|
||||
q.append(x)
|
||||
seen.add(vertex)
|
||||
return result
|
||||
|
||||
print(topo_sort(unweighted_digraph))
|
||||
Loading…
Add table
Add a link
Reference in a new issue