i just have a question : so the topological-sorting algorithm generates different outputs ? that means : i can choose one of the paths drawn in the end right ? for example a topology-sorted Graph will be -> c-d-e or c-a-d-e or c-a-d-b-e ... ??
It depends on the type of ordering you are after, in this example, I just went with alphabetical ordering but you can imagine other types of ordering depending on your needs. So in theory you CAN choose different paths but they may not give you the results you are looking for unless you apply the ordering scheme to which you are going after.
this is the best topological sort explanation out there
thank you very much Andre!
Short and simple, love the explanation.
Super smart and clear, Thanks man.
Thank you for your kind words sir : )
Super clear explanation, thank you so much I can write topological sort now!
I appreciate it
Great and well put together! Thank you!
This is just excellent! You're awesome dude!
nice video ..i can easily understand without wasting any much time ....so thanks for
it
thank you!
I love these videos. great job. I like your teaching style.
this video was very clear and easy to understand!
Thank you very much!
i have a import exam and your vedic help me tanks a lot
good luck on the exam :)
Mañana tengo examen .Realmente me ayudaste T-T Muchas Gracias :)
I am happy to help in any way, good luck on the exam! :)
nice work make more videos
thank you very much, please suggest any particular videos you would like to see
yeah, I like this kind of "easy to understand" example
great video
Thank you :)
grt
please make video on how to calculate complexties please
Helpful
! Does this mean that You just are just making the graph more better (make it like a line) to see and understand better?
I think that The genuine graph is not changed.
well you are sorting right? I am not sure what you mean exactly.
i just have a question : so the topological-sorting algorithm generates different outputs ? that means : i can choose one of the paths drawn in the end right ? for example a topology-sorted Graph will be ->
c-d-e or
c-a-d-e or
c-a-d-b-e ... ??
It depends on the type of ordering you are after, in this example, I just went with alphabetical ordering but you can imagine other types of ordering depending on your needs. So in theory you CAN choose different paths but they may not give you the results you are looking for unless you apply the ordering scheme to which you are going after.
thanks a lot
i am glad i can help :)
in this problem How many such orderings are there? can you tell me
you can count them (slow process) at least for this problem.
thanks for this video !!
nice explaination thnx
Thank You
Thank you sir!
tinotenda nema video enyu anobatsira chaizvo
tenda iwe nyatso zvakanyanya, Ndiri fara i abatsira