(1) BFS and DFS both stores every node of the graph. So, storage location must be same for both of them
(2) is true always
take this graph for example. Shortest path will not change when u double every edge weight
After a lot of example checking, I concluded that, if we double an edge or we break that edge in some part, and then double each part, shortest path will not change.