A graph data structure is a collection of nodes that have data and are connected to other nodes.
It is a node, which is an object with zero or more adjacent vertices.
It is a connection between two nodes or vertex.
They are the adjacent nodes of the node.
It is a number of edges connected to that vertex or node.
Directed graphs is a graph where every edge is directed. Undirected graphs is a graph where each edge is undirected.
A Complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge.
It is a graph in which each node has at least one edge.
It is a graph in which some node may not have edges.
An acyclic graph is a directed graph without cycles.
A Cyclic graph is a graph that has cycles.
It is a graph with graph numbers assigned to its edges.
By using a weight you can make calculation to find the better path, by calculation the total sum of the eges in each path.
We can use either use Breadth First or Depth First in travelling in the gragh.
