Advanced Graph Terminology
A Directed Graph consists of nodes (vertices) connected by directed edges (arcs). Each edge has a specific direction, meaning it goes from one node to another. Directed Graph is a network where information flows in a specific order. Examples include social media follower relationships, web page links, and transportation routes with one-way streets.
2. Undirected Graph:
In an Undirected Graph, edges have no direction. They simply connect nodes without any inherent order. For example, a social network where friendships exist between people, or a map of cities connected by roads (where traffic can flow in both directions).
3. Weighted Graph:
Weighted graphs assign numerical values (weights) to edges. These weights represent some property associated with the connection between nodes. For example, road networks with varying distances between cities, or airline routes with different flight durations, are examples of weighted graphs.
4. Unweighted Graph:
An unweighted graph has no edge weights. It focuses solely on connectivity between nodes. For example: a simple social network where friendships exist without any additional information, or a family tree connecting relatives.
5. Connected Graph:
A graph is connected if there is a path between any pair of nodes. In other words, you can reach any node from any other node. Even a single-node graph is considered connected. For larger graphs, there’s always a way to move from one node to another.
6. Acyclic Graph:
An acyclic graph contains no cycles (closed loops). In other words, you cannot start at a node and follow edges to return to the same node. Examples include family trees (without marriages between relatives) or dependency graphs in software development.
7. Cyclic Graph:
A cyclic graph has at least one cycle. You can traverse edges and eventually return to the same node. For example: circular road system or a sequence of events that repeats indefinitely.
8. Connected Graph
A Graph is connected if there is a path between every pair of vertices in the graph. In a directed graph, the concept of strong connectivity refers to the existence of a directed path between every pair of vertices.
9. Disconnected Graph:
A disconnected graph has isolated components that are not connected to each other. These components are separate subgraphs.
10. Tree
A Tree is a connected graph with no cycles. It is a fundamental data structure in computer science, commonly used in algorithms like binary search trees and heap data structures. Trees have properties such as a single root node, parent-child relationships between nodes, and a unique path between any pair of nodes.
Graph terminology in data structure
Graphs are fundamental data structures in various computer science applications, including network design, social network analysis, and route planning. Understanding graph terminology is crucial for effectively navigating and manipulating graph data structures. In this article, we will discuss the graph terminology used in the data structure.
Table of Content
- Importance of Graph Terminology
- Basic Graph Terminology
- Advanced Graph Terminology
- Applications of Graph