Structura datelor grafice și Algorithms (Exemplu)

prin: Sarah Chen Sarah Chen
Hours Actualizat

⚡ Rezumat inteligent

Graph Data Structure is a non-linear collection of vertices and edges where each edge links a pair of vertices. Graphs model real-world networks such as maps, social connections, and web pages, and support many powerful algorithms.

  • 📐 Structura: A graph G = (V, E) pairs a set of vertices (nodes) with a set of edges (links) between them.
  • 🔤 Terminologie: Key terms include vertex, edge, degree, indegree, outdegree, self-loop, and adjacency.
  • 🗂️ Reprezentare: Graphs are stored using an adjacency matrix or an adjacency list, each with different space trade-offs.
  • 🧭 tipuri: Directed, undirected, weighted, cyclic, acyclic, complete, bipartite, and more classify graphs by structure.
  • 🌐 Aplicații: Google Maps routing, social networks, web ranking, and resource dependency all rely on graphs.
Citește mai mult

Structura datelor grafice și Algorithms

Ce este un grafic în structura datelor?

A graph is a non-linear data structure that consists of vertices and edges, where vertices contain the information or data, and the edges work as a link between a pair of vertices.

It is used to solve real-world problems like finding the best route to the destination location and the route for telecommunications and social networks. Users are considered a node in the Graph, and the wires are the edges connecting the users.

Dacă muchiile sunt reprezentate ca E și vârfurile sunt reprezentate ca V, atunci graficul G poate fi scris ca mulțime de vârfuri și muchii, cum ar fi G (V, E).

Exemplu de grafic în structura datelor

Here is a simple example of a graph data structure:

Exemplu de grafic în structura datelor

It is a simple undirected graph (one kind of Graph). Here the set of vertices is: {A, B, C, D, E, F}. Two vertices create an edge. For example, A and B are linked with an edge. However, A and F are not linked with any edges.

Terminologii grafice în structura datelor

The following are some important terms used in the graph data structure:

TermenDescriere
CulmeEach data element is called a vertex or a node. In the above image, A, B, C, D & E are the vertices.
Marginea (Arc)Connecting links between two nodes or vertices are called an edge (Arc). It has two ends and is represented as (startingVertex, endingVertex).
Marginea nedirecționatăEste o margine bidirecțională.
Marginea DirijatăEste o margine unidirecțională.
Marginea ponderatăAn edge with a value on it.
GradIn a Graph, the number of edges connected to a vertex is called a degree.
IndegreeNumărul total de muchii de intrare conectate la un vârf.
OutdegreeNumărul total de muchii de ieșire conectate la un vârf.
Auto-buclăO muchie se numește auto-buclă dacă cele două puncte finale coincid.
AdiacentaVertices are said to be adjacent if an edge is connected between them.

ARTICOLE SIMILARE

Tipuri de grafice în structura datelor

Iată lista celor mai comune tipuri de grafice din structura datelor:

  • Graficul Dirijat
  • Grafic nedirecționat
  • Graficul ponderat
  • Grafic bidirecțional
  • Grafic infinit
  • Grafic nul
  • Grafic trivial
  • Grafic multiplu
  • Graficul complet
  • Graficul conectat
  • Graficul ciclic
  • Grafic aciclic direcționat (DAG)
  • Graficul ciclului
  • Graficul bipartit
  • Graficul Euler
  • Graficul Hamilton

How to Represent a Graph in Data Structure?

A graph is commonly stored in memory using one of two representations. The choice affects how much memory the graph uses and how fast common operations run.

  • Matricea adiacentei: A two-dimensional V × V array where cell [i][j] is 1 (or the edge weight) if an edge exists between vertex i and vertex j, and 0 otherwise. It allows O(1) edge lookup but uses O(V²) space, making it best for dense graphs.
  • Listă de adiacență: An array of lists where each vertex stores a list of its neighbouring vertices. It uses O(V + E) space and is efficient for sparse graphs, which is why most real-world graphs use it.

You can read more about these in the adjacency list and matrix representation of a graph tutorial.

Aplicații ale structurii de date grafice

A graph has many use cases. There are a lot of algorithms that use Graphs. Here are some of the applications of the Graph:

  • Google Maps uses graphs to find the intersection of two roads and calculate the distance between two locations. For example, dijkstra, for finding the shortest distance between the source and destination location.
  • Facebook uses Graphs to find the mutual friends of the users. Its algorithm considers each user as a node of a graph.
  • For resource allocation, a DAG (Directed Acyclic Graph) is used. It checks the dependency of the resources.
  • Google Motoarele de căutare folosesc grafice pentru a crea clasamentul site-urilor web.
  • O hartăping Dispozitivul utilizează structura de date grafică.
  • A Router and its protocol use the Graph to learn the path to the destination.

Întrebări frecvente

Graph Neural Networks learn from graph-structured data for fraud detection, recommendations, and drug discovery. Knowledge graphs support AI question-answering, and deep learning frameworks model every computation as a graph of operations.

Yes. AI assistants like GitHub Copilot can generate BFS, DFS, Dijkstra, and topological sort implementations from a plain description. You should still test edge cases such as disconnected nodes, cycles, and empty graphs before using the code.

A tree is a special type of graph that is connected and has no cycles, with exactly one path between any two nodes. A graph is more general: it can contain cycles, disconnected parts, and directed or weighted edges.

The two main traversal methods are Breadth-First Search (BFS), which explores level by level using a queue, and Depth-First Search (DFS), which explores as deep as possible using a stack or recursion before backtracrege.

Rezumați această postare cu: