weighted graph Archives - NeuralLantern.com

Directed Weighted Graph Edge List Representation

A directed weighted graph can be stored as a pair of lists: every vertex in one list, and every edge as a three-part tuple of start node, end node, and weight. Replacing the node values with indexes into the vertex list lets you jump to those nodes in constant time after you find an edge.

mike September 13, 2026

Computer Science Data Structures Graphs

Graph Basics in Data Structures: Nodes, Edges, and Representations

Graphs are collections of nodes and edges, or vertices and edges. In this tutorial we implement them as template classes in C++ so you can use custom data types for nodes and edge weights. We cover undirected unweighted graphs, then add directions and weights to show path costs between cities or network nodes.

mike July 14, 2026

Computer Science Data Structures Graphs

4 Graph Types: Undirected vs Directed, Weighted vs Unweighted

A graph is basically a collection of nodes, also known as vertices, and edges, which are the lines that connect nodes to each other. The four types of graphs are undirected unweighted, undirected weighted, directed unweighted, and directed weighted. Graphs help represent relationships between things like computers in a network or cities and airports.

mike July 6, 2026