Given below is a directed acyclic graph in the format of an Adjacency List:
A: B, C, F
B: D
C: B, D
D:
F:
How many different topological sortings does the graph have? Print the number in the field below.
Given below is a directed acyclic graph in the format of an Adjacency List:
A: B, C, F
B: D
C: B, D
D:
F:
How many different topological sortings does the graph have? Print the number in the field below.
Create a free account to access the full topic