Graph Algorithm 1

0. Consider the following directed graph:

 The number of different topological ordering of the vertices of the graph is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *