Sir, in this problem how can I assign weight to graph in order to find minimum time?
Djikstra question
hello @yashme7125
here each vertex of graph will have weight which is nothing but time to kill Hermione.
and edges will be connecting two adjacent negibhours , and they will not have any weight.
check this for reference-> link
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.