- Uses:
- Social Networks, Recommendation Engines (Netflix, "people also watched"), Location Mapping, Routing Algorithms, Visual Heirarchy
- A graph is a collection of nodes and connections between those nodes
- There is no parent node, all nodes are treated equally
- Vertex - A vertex, also called a “node”, is a data object that can have zero or more adjacent vertices
- Edge - An edge is a connection between two nodes.
- Weighted - when values are assigned to the edges (think maps and distances)
- Unweighted - no weights assigned with the edges
- Directed - have a direction in how you can traverse between two vertices along an edge (often repesented with arrows) (Instagram)
- Undirected - there is no direction (traversal both ways) associated with an edge (FB friends)
- Neighbor - The neighbors of a node are its adjacent nodes, i.e., are connected via an edge.
- Degree - The degree of a vertex is the number of edges connected to that vertex.