Weighted Graph

overview

Remember these Terms

• Vertex (Node): a labeled point in the graph.
• Edge: a connection between two vertices.
• Weight: the numeric cost or distance on an edge.
• Path: a sequence of edges linking vertices.
• Path cost: total of weights along a path.
• Directed vs undirected: edges with direction or without.
• Shortest path: path between vertices with minimal cost.
• Minimum Spanning Tree (MST): connects all vertices with minimal total weight.