Read 35 ~ Graphs

By Abdallah obaid

NAME	URL
Home	Home.
Prep	Prep: Engineering Topics.
Read 01	Node Ecosystem, TDD, CI/CD.
Read 02	Classes, Inheritance, Functional.
Read 03	Data Modeling & NoSQL Databases.
Read 04	Advanced Mongo/Mongoose.
Read 05	Linked Lists.
Read 06	HTTP and REST.
Read 07	Express.
Read 08	Express Routing & Connected API.
Read 09	API Server.
Read 10	Stacks and Queues.
Read 11	Authentication.
Read 12	OAuth.
Read 13	Bearer Authorization.
Read 14	Access Control (ACL).
Read 15	Trees.
Read 16	Event Driven Applications.
Read 17	TCP Servers.
Read 18	Socket.io.
Read 19	Message Queues.
Read 26	Component Based UI.
Read 27	React Testing and Deployment.
Read 28	Props and State.
Read 29	Component Composition.
Read 30	Hash Tables.
Read 31	Hooks API.
Read 32	Custom Hooks.
Read 33	Context API.
Read 34	<Login /> and <Auth />.
Read 35	Graphs.

---

# Graphs ———————————- ## Graph:

• A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.

## Terminology:

1. Vertex: A vertex, also called a “node”, is a data object that can have zero or more adjacent vertices.
2. Edge: An edge is a connection between two nodes.
3. Neighbor: The neighbors of a node are its adjacent nodes, i.e., are connected via an edge.
4. Degree: The degree of a vertex is the number of edges connected to that vertex.

## Undirected Graphs:

• An Undirected Graph is a graph where each edge is undirected or bi-directional. This means that the undirected graph does not move in any direction.
• The connection is bi-directional: When there are no “directions” given to point to specific vertices. .

## Directed Graphs (Digraph):

• A Directed Graph “Digraph” is a graph where every edge is directed.
• In Digraph has direction, each node is directed at another node with a specific requirement of what node should be referenced next. ## Types of Graphs:
  1. Completed.
  2. Connected.
  3. Disconnected.