Linked from

The 12 pages that link to Weighted graph, each with the reason it gives.

• Graph (discrete mathematics)Broader topic: Weights attach costs, distances, or strengths to otherwise unqualified connections.

• Shortest path problemRelated: Its edge weights supply the quantities summed along candidate paths.

• Edge (graph theory)Broader topic: An edge weight adds quantitative information to the connection.

• Dijkstra's algorithmRelated: The algorithm compares sums of edge weights to rank paths.

• Simple graphCompared with: Weights add information to edges without changing whether the underlying graph is simple.

• Adjacency listRelated: A list entry can store both a neighboring vertex and the connecting edge's weight.

• Bellman–Ford algorithmRelated: Those weights determine the path costs Bellman–Ford compares.

• Degree matrixCompared with: Its degree matrix may use weighted sums rather than counts of incident edges.

• Floyd–Warshall algorithmNarrower topic: Floyd–Warshall operates on edge weights and compares sums of path weights.

• Kruskal's algorithmBroader topic: The edge weights determine the order in which Kruskal considers edges.

• Laplacian matrixRelated: Edge weights replace binary adjacency values in weighted Laplacians.

• Directed networkCompared with: Weights add costs or strengths; they do not themselves specify edge direction.