Weighted Graphs
Graphs so far have considered
- edge = an association bewteen two vertices/nodes
- may be a precedence in the association (directed)
Some applications require us to consider
- a cost or weight of an association
- modelled by assigning values to edges (0..1?, -ve?)
Weights can be used in both directed and non-directed graphs.
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}