It's a one kind of data structure, consists of Node(or Vertex) and Edge which connects between Vertexes. Represented as G = (V,E)
- Path: a path from specific Vertex to another
- Cycle: Starting from A and comes back to starting point
- Simple Path and Simple cycle: The cycle which does not visiting the already passed Vertexes
- Dierected Graph : Path with unidirectional path
- Undirected Graph: Path with bidirectional path, Called Bidirection Graph