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

Zscaler: iOS apps leak more user data than Android apps

By analyzing the transaction status of devices pr...

Why are succulents drought-tolerant?

Produced by: Science Popularization China Author:...

Developers, please note that WebKit is getting a new upgrade!

Introduction Currently, the default browser kerne...

A hero may not always ride on colorful clouds, but may ride on a small boat...

Recently, Xinyang City, Henan Province A young ma...

The world's first! Tsinghua team successfully developed a "memristor chip"!

Recently, the team of Professor Wu Huaqiang and A...

Operational methodology: How to carry out private domain operations well?

If public domain traffic is the ocean, then users...

Google: 10 rules you must know to build a great mobile app

The differences between iOS and Android are the r...

Use Fly to initiate http requests in WeChat applet

The javascript running environment of WeChat appl...