Question

topological sort examples​

Answer 1

hello

For example, a topological sorting of the following graph is “5 4 2 3 1 0”. There can be more than one topological sorting for a graph.

hey please mark brainliest if it's correct ✌

Answer 2

${\huge{\boxed{\mathbb {\blue{HEYAA \: \: MATE}}}}}$

Answer:

In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.

BRAINLIEST ❤