Data Structure of Information Olympiad

Data Structure of Information Olympiad

Brief introduction to the data structure resources of the Information Science Olympiad:

Course Outline

01-Stack Data Structure

02-Vector Data Structure

03-Queue data structure

04-Breadth-First Search

05-Basic concepts of trees and binary trees

06-Binary tree storage and traversal questions

07-Heap sort and priority queue

08-Huffman Tree

09-Basic concepts of graphs

10-Graph Storage

11-Depth-first and breadth-first traversal of a graph

12-Euler Road and Hamilton Ring

13-Depth-first shortest path

14-Floyd's shortest path algorithm

15-Dijkstra algorithm

16-Bellman-Ford Shortest Path Algorithm

17-SPFA shortest path algorithm

18-Graph Connectivity

19-Join and Find

20-Minimum spanning tree Prim algorithm

<<:  Learn character design with Hollywood animation masters 2020 [good quality]

>>:  Zhihu traffic growth rules!

Recommend

Why traffic products are bound to become mediocre

Nowadays, many products are labeled as internet c...

How can a startup company promote itself without any funds?

Startup companies are generally in a state of hav...

What is that thing tied to the bird's leg?

Bird migration has always been an important topic...

50 marketing models that planners must have in 2022

I have the model in hand and the idea. If you don...

Amazon's new wave of machine learning: powerful and actionable

[51CTO.com Quick Translation] Professional users ...

How to do data analysis for information flow promotion?

It seems that many entrepreneurs like to talk abo...

Qiuye Office three-in-one office application, from novice to expert course

Qiuye Office 3-in-1 Tutorial: Word, Excel, PowerP...