In this type of graph each edge (path between nodes) has a number associated with it, these number are called weights. This can be used to evaluate, for example, the cost or the time to travel between one node and another.