In graph theory which one of these two will be called a weighted graph ?
- A graph where vertices have some weights or vales .
- A graph where edges have some weights or values .
- A graph where both edges and vertices have some weights or values
- A graph where neither edges nor vertices have any weights or values
I couldn't find a picture for the third case actually .