# What do the weights of edges in Djikstra represent?

I have just followed a course in coursera called "Motion Planning for Self Driving Cars" by the University of Toronto. I understand that the algorithm Dijkstra is used for a graph search where the weights of each edge are different compared to the Best First Search (BFS). For a self-driving car on the road, I understand that these weights are the length of each road for example.

However, I have implemented the Dijkstra algorithm as a global planner for my Turtlebot and I am wondering, in the case of an office space with no roads, what would the edge weights represent? Do they still represent distances, and if so, how far apart are the nodes placed from each other such that it gives rise to different edge weights?