Uniform Cost Search Algorithm aims to find the goal node with the shortest path by exploring all possible paths in a graph. To achieve this, we assign a cost to each path and select the path with the lowest cost that leads to the goal node.We have three paths to reach the goal node "G" from the starting node "S." Path 1: S->A->C->E->G with a cost of 14 Path 2: S->A->D->G with a cost of 6 Path 3: S->B->G with a cost of 9 In this case, we need to select the path with the lowest cost, which is Path 2: S->A->D->G with a cost of 6. Therefore, Uniform Cost Search Algorithm prioritizes the path with the lowest cost to find the goal node with the shortest path.
at the end of the video, while working with the example, you are not considering cumulative cost from the root node, you are just looking for immediate successors this is the mistake. otherwise what is the use of the priority queue?
exactly, showed like a greedy algorithm which is wrong, This is BFS with weighted edges and needs to traverse all the nodes and gives priority to the cumulative cost.
It's not like that, you have to find the cumulative sum. I noticed that, she copied the entire content from the tutorial point site, and her concepts are not clear, she is just trying to put content as it is,
Bhanu priya mam, thank you from Bangladesh. Your videos help me a lot.
Uniform Cost Search Algorithm aims to find the goal node with the shortest path by exploring all possible paths in a graph. To achieve this, we assign a cost to each path and select the path with the lowest cost that leads to the goal node.We have three paths to reach the goal node "G" from the starting node "S."
Path 1: S->A->C->E->G with a cost of 14
Path 2: S->A->D->G with a cost of 6
Path 3: S->B->G with a cost of 9
In this case, we need to select the path with the lowest cost, which is Path 2: S->A->D->G with a cost of 6. Therefore, Uniform Cost Search Algorithm prioritizes the path with the lowest cost to find the goal node with the shortest path.
You're my hero 🧢
How you can give weightage numbers mam?
what is the meaning of cost in uniform-cost-search
Can you provide the notes, making it a pdf and sharing a drive link maybe
Your concise notes will be real helpful for exam
Space complexity and time complexity?
Mam I didn't got fundamental of numbering
at the end of the video, while working with the example, you are not considering cumulative cost from the root node, you are just looking for immediate successors this is the mistake. otherwise what is the use of the priority queue?
exactly, showed like a greedy algorithm which is wrong, This is BFS with weighted edges and needs to traverse all the nodes and gives priority to the cumulative cost.
Are we told what is goal node in UCS or we can assume any node as goal node?
In the question it would be mentioned about the goal state and start state
It's not like that, you have to find the cumulative sum. I noticed that, she copied the entire content from the tutorial point site, and her concepts are not clear, she is just trying to put content as it is,
she doesn't copy from there she write blogs in tutorial point
6:15 in this you made a mistake, you said 1+2+3 = 5 ❌, but anyway explanation was good. ✔️
1+2+3 = 5
The expansion is good for me
Galat Hai bhai
This is incorrect, you made no use of any priority queue, this is just greedy search.
new word found: avaaaaaailable
Pehle aap sikh lo thik se fir banana video
pls remove video wrong info
Idk why there are so much haters in chat
the algorithm is wrong
Because it is wrong
Nope it's absolutely correct it is given the same example in the jntu pdf
total node = 1 + 2 + 3 = 6 not 5
True
no wrong want big example
this is best first search, not uniform cost search, please correct
No brother it's a uniform cost search
incorrect
not even close
wrong
wtf this video is so useless. I want my 6 minutes back.
wrong
Phele ache se sikh lo aunty
wrong explanation
really /
?