hi ppl... I need some help with an 3d pathfind with waypoints using Dijkstra's Algorithm, Any idea? Best Regards

Yes, of course.

I recall that its a Breadth first search where you track a lowest (accumulative) cost to reach each node and recompute subsequent new lower adjacents when needed.

Your 3D waypoints are simply a network where you identify all the adjacents for the nodes and trheor costs (done once). You then apply the search from a start point to the end point to find the cheapest path.

What kind of help do you need?
What are the requirements of your pathing system? What kind of data makes up the graph? Does this data actually form a graph yet, or is that part of the problem too? Why did you choose Dijkstra's Algorithm over other pathfinders?

Unless you tell us what your problem is, we're not going to be able to give you any helpful advice (beyond wikipedia links).