MindMap Gallery data structure
Data structure organization is used for sorting, organizing and classifying data at work.
Edited at 2021-01-30 23:21:27Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
data structure
linear data structure
linear table
stack
queue
algorithm
feature
certainty
Finiteness
feasibility
Zero or more inputs
one or more outputs
assessment
Robustness
readability
correctness
time complexity
space complexity
Tree
picture
Basic storage structure
The adjacency matrix (sequential storage) uses two arrays to store the vertex set and edge set respectively.
Adjacency list (linked storage) (not unique)
Cross linked list (directed graph)
Adjacency multiple list (undirected graph)
basic concept
Undirected graph
connected graph
connected components
directed graph
Strongly connected graph
Strongly connected component
Graph traversal
Breadth First BFS
Depth-first DFS
Minimum spanning tree (not unique but with the same weight sum)
Prim
Cruskal
topological sort
AOV net: a net whose vertices represent activities (directed acyclic graph)
Critical Path
AOE network: The edges of the directed graph represent the active network, and the path with the maximum length is called the critical path.
shortest path
algorithm
Dijkstra
Floyd
Find
sort
insertion sort
direct insertion sort
half insertion sort
Hill sort / reducing incremental sort / Shell
selection sort
Simple selection sort
Heap sort
Tournament sorting
swap sort
Bubble Sort
Quick sort
merge sort
Radix sort