Weight (graph theory)

from Wikipedia, the free encyclopedia

In graph theory, weight is a real number that is assigned to a node (as node weight) or an edge (as edge weight). You then get a node or edge weighted graph . For example, a road network can be modeled as a graph in which distances or travel times correspond to the edge weights. A shortest or longest path , for example, can then be calculated with the aid of this model .

Individual evidence

  1. ↑ Hartmut Noltemeier: Graph Theoretical Concepts and Algorithms . 3. Edition. Vieweg + Teubner Verlag, Wiesbaden 2012, ISBN 978-3-8348-1849-2 , pp. 74 .