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

26 questions and answers about short video operations!

1. How to upload videos without being complained ...

BlackBerry Classic, a nostalgic phone that bids farewell to an era

10 months ago, when BlackBerry released Passport,...

How does the biological clock work? Does it also have gears and pointers?

Science Fiction Network, April 7th. We all have a...

Since even light cannot escape from a black hole, why can it be "seen"?

Black holes have always been an incredible existe...

Repetition and iteration of brand strategy

Repetition is the enemy of creativity, but it is ...

How to promote user conversion? 99% of them used this trick~

Today, I want to share with you a trick to promot...

What is nofollow? What does nofollow mean?

Many friends who are engaged in website SEO optim...