Does Dijkastra's Algorithm work in undirected graph with negative weights?

Question

programmer say that dijkastra algorithm doesn't work for negative graph weight but I think that it works for undirected graph in negative weights and (I know that it don't work for directed negative weight graph) You see that prim's algorithm also works like dijkastra algorithm and it work for undirected negative weight (so why dijkastra can't work in negative weight of undirected graph) I found many programmers logic, they always talk about directed graph ,but I have confusion about undirected graph. I will be grateful to him who can give me an undirected negative weight graph where dijkastra fails.

You see that prim's algorithm also works like dijkastra algorithm and it works for undirected negative weight (so why dijkastra can't work in negative weight of undirected graph)