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.

@varshinimadhu7321

5 ай бұрын

You're my hero 🧢

Bhanu priya mam, thank you from Bangladesh. Your videos help me a lot.

How you can give weightage numbers mam?

what is the meaning of cost in uniform-cost-search

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?

@042_md.shabuktahaidereric8

5 ай бұрын

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?

@chaitrachowdary2482

Жыл бұрын

In the question it would be mentioned about the goal state and start state

Can you provide the notes, making it a pdf and sharing a drive link maybe Your concise notes will be real helpful for exam

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,

@abhaykanwasi881

Жыл бұрын

she doesn't copy from there she write blogs in tutorial point

1+2+3 = 5

The expansion is good for me

@lifeisstrangevideos3924

2 жыл бұрын

Galat Hai bhai

This is incorrect, you made no use of any priority queue, this is just greedy search.

Pehle aap sikh lo thik se fir banana video

total node = 1 + 2 + 3 = 6 not 5

@shaikashfaq5990

10 ай бұрын

True

pls remove video wrong info

this is best first search, not uniform cost search, please correct

@keshavreddy2896

3 ай бұрын

No brother it's a uniform cost search

Idk why there are so much haters in chat

@geop2001

2 жыл бұрын

the algorithm is wrong

@lifeisstrangevideos3924

2 жыл бұрын

Because it is wrong

@Bhanu-uo3wo

Жыл бұрын

Nope it's absolutely correct it is given the same example in the jntu pdf

no wrong want big example

new word found: avaaaaaailable

6:15 in this you made a mistake, you said 1+2+3 = 5 ❌, but anyway explanation was good. ✔️

not even close

incorrect

wrong

wtf?

Phele ache se sikh lo aunty

wrong

wtf this video is so useless. I want my 6 minutes back.

wrong explanation

@HappySingh-sh3lw

4 жыл бұрын

really / ?