• Nodes, Edges
• No root node like trees
• Edges can contain data, like strength of conection, etc.
• Edges can have a direction, “Directed Edge”
• “Undirected Graph”, Edges with no direction
• Graphs can loop back to the start, unlike Trees
• “DAG” - Directed Acyclic Graph, - Graph that does not loop

Disconnected graph has one or more nodes not connected to the rest of the graph.

Edge List or 2D or 3D List

Depth First Search

Use a Stack.

Breadth First Search

Use a Queue

If the edges are unweighted, the shortest past is found via BFS.