Graph Data Structure

WHAT ARE GRAPHS
A graph data structure consists of a finite (and possibly mutable) set of vertices or nodes or points, together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph.
USES FOR GRAPHS

• Social Networks
• Location / Mapping
• Routing Algorithms
• Visual Hierarchy
• File System Optimizations

ESSENTIAL GRAPH TERMS

• Vertex – a node
• Edge – a connection between nodes
• Weighted/Unweighted – values assigned to distances between vertices
• Directed/Undirected – directions assigned to distanced between vertices

Undirected and Directed Graphs
In the undirected graphs, all the edges are connected bi-directionally. That is they are connected to more than one node at the same time, while a directed graph the edges are directed to a particular vertex.

 

Written by Ebube Okocha