Node-weighted graph

from Wikipedia, the free encyclopedia

In graph theory, a node-weighted graph is a graph whose nodes are assigned a node weight in the form of a real number. A graph whose edges are weighted is called an edge-weighted graph .

In addition to specifying the number of nodes and edges, a node-weighted graph also includes the specification of a function that maps the nodes into the set of real numbers .

See also