VisuAlgo - Graph Data Structures (Adjacency Matrix, Adjacency List, Edge List)
source link: https://visualgo.net/en/graphds?slide=1
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
A graph is made up of vertices/nodes and edges/lines that connect those vertices.
A graph may be undirected (meaning that there is no distinction between the two vertices associated with each bidirectional edge) or a graph may be directed (meaning that its edges are directed from one vertex to another but not necessarily in the other direction).
A graph may be weighted (by assigning a weight to each edge, which represent numerical values associated with that connection) or a graph may be unweighted (either all edges have unit weight 1 or all edges have the same constant weight).
Remarks: By default, we show e-Lecture Mode for first time (or non logged-in) visitor.
Please login if you are a repeated visitor or register for an (optional) free account first.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK