Implementing A* pathfinding in topdown game

Hello

I’m trying to implement A* pathfinding in my 2D topdown game but I have a few questions before I start:

From watching a few yt tutorials and reading some more information I have the understanding that I should create a vector3 list that holds all the positions of my nodes. If I fill my map with nodes it would be around the 26thousand, is this to much?

What would be the best method to find a specific node in this big list? Heap?

You don’t need the position of all your nodes, you just need a List for the fringe and the visited nodes.

I didn’t think of that, thanks!