Texonom
Texonom
/
Computing
Computing
/Data/Data Structure/
Graph Data
Search

Graph Data

Creator
Creator
Seonglae Cho
Created
Created
2021 Apr 13 14:8
Editor
Editor
Seonglae Cho
Edited
Edited
2024 Mar 5 13:25
Refs
Refs
Graph Theory
Network Theory
Tree Data

Each node does not have priority

G=(V,E)E⊂V×V∣E∣=O(V2)G = (V, E) \newline E \subset V\times V \newline |E| = O(V^2)G=(V,E)E⊂V×V∣E∣=O(V2)
Graph Data Structure
Graph cycle
Directed Graph
Undirected Graph
Adjacency matrix
Adjacency list
Connected graph
Connectivity
 
 
 
 

Why it is hard to use real implementation

The Hunt for the Missing Data Type
A (directed) graph is a set of nodes, connected by arrows (edges). The nodes and edges may contain data. Here are some graphs: All graphs made with graphviz (source) Graphs are ubiquitous in software engineering: Package dependencies form directed graphs, as do module imports. The internet is a graph of links between webpages. Model checkers analyze software by exploring the “state space” of all possible configurations.
The Hunt for the Missing Data Type
https://www.hillelwayne.com/post/graph-types/
 
 

Recommendations

Texonom
Texonom
/
Computing
Computing
/Data/Data Structure/
Graph Data
Copyright Seonglae Cho