Training

Location:Training / Machine Learning/Algorithm / Data Structure Shanghai Jiao Tong University / Kruskal algorithm, topological sorting, critical path, dijksra algorithm

You can log in to your eeworld account to continue watching：
Kruskal algorithm, topological sorting, critical path, dijksra algorithm
Login

Chapter 1：Definition of data structure, basic terms, algorithm time and space complexity
Chapter 2：Type definition, implementation, basic operations and applications of linear tables
Chapter 3：Definition and basic operations of linear lists, linear linked lists
Chapter 4：Single linked list, circular linked list, two-way circular linked list
Chapter 5：Definition, representation and implementation of stack, push and pop operations
Chapter 6：Numeric conversion, bracket matching, expression evaluation
Chapter 7：The structure, operation, and enqueuing and dequeuing algorithms of circular queues
Chapter 8：Linked list merging, singly linked list inversion
Chapter 9：Stack input and output, palindrome numbers, queue operations
Chapter 10：Circular queue, double-ended circular queue, two-way stack, string
Chapter 11：String pattern matching algorithms, tree definitions and basic terminology
Chapter 12：Properties of binary trees, full binary trees, complete binary trees, binary linked lists
Chapter 13：Recursive and non-recursive algorithms for binary tree traversal
Chapter 14：In-order clue binary tree, in-order, two-way clue linked list
Chapter 15：Hierarchical traversal of binary trees, complete binary trees, and binary linked lists
Chapter 16：Representation of trees, conversion between forests and binary trees, and traversal
Chapter 17：Huffman tree and its applications, prefix coding, Huffman coding
Chapter 18：The construction process of Huffman tree, Huffman coding algorithm, and message decoding
Chapter 19：Graph, vertex, arc, directed graph, undirected graph, complete graph, connected graph
Chapter 20：Adjacency matrix, adjacency list, cross linked list, adjacency multiple list
Chapter 21：Graph traversal, connected components, minimum spanning tree, Prim algorithm
Chapter 22：Kruskal algorithm, topological sorting, critical path, dijksra algorithm
Chapter 23：Ordered table search, binary search, index sequence table search
Chapter 24：Binary sort tree, B+ tree, B-tree, hash table
Chapter 25：Direct insertion sort, half insertion sort, Hill sort
Chapter 26：Quick sort, selection sort, heap sort, merge sort, radix sort
Chapter 27：Circular linked list, linked stack, circular queue, doubly linked list
Chapter 28：Reverse, search and sorting of singly linked lists, determination and adjustment of heaps
Chapter 29：Conversion of trees and binary trees, adjacency list of undirected graph, adjacency matrix representation

Duration：1 hours and 13 minutes and 23 seconds
Date：2019/12/28

Uploader：抛砖引玉

Introduction

keywords： Tree the complexity Stack

A data structure refers to a collection of data elements that have one or more specific relationships with each other. Under normal circumstances, carefully selected data structures can bring higher operating or storage efficiency. Data structures are often related to efficient retrieval algorithms and indexing technologies. This tutorial is from the shallower to the deeper and is super detailed. It is suitable for self-study, classroom teaching and after-class review and examination. Shanghai Jiao Tong University's algorithm and data structure video tutorial is taught by teacher Tan Xiaohong. Basically, no key points and difficulties are missed. The main contents of this course include: basic concepts related to data structure, basic operations and applications of linear tables, and the definition and application of stacks and queues. Basic operations, string pattern matching algorithms, basic concepts and algorithm implementations related to binary trees, graph storage structures and algorithms, and various search and sorting algorithms, etc.

You Might Like

Recommended Posts

Infrared remote control multi-channel lamps: Infrared remote control multi-channel lamp circuit, can be used for fluorescent lamp electronic ballast remote control. This is the circuit diagram of the infrared transmitter. 500) {this.resized=true; zbz0529 Power technology

Verifying complex ASICs through FPGA prototyping: [table=98%][tr][td=2,1,690][table=98%][tr][td]Process technology has been developing at an uninterrupted pace and has reached the 65nm stage. Advanced process technology also allows complex designs wi; 程序天使 FPGA/CPLD

Questions about DSP and FPGA sharing SDRAM!: I plan to use AD+6713+FPGA+SDRAM on a processing board.I want to store AD data in SDRAM through FPGA, and then 6713 goes to SDRAM to fetch data for processing.FPGA and DSP share SDRAM memory (through; emaster DSP and ARM Processors

[color=#FF0000]Urgent!!!!!! How can I open a video file in .m4c format?[/color]: [color=#FF0000]Urgent!!!!!! How can I open a video file in .m4c format?[/color]; milanmaldini Embedded System

How to write Verilog to calculate the amplitude and angle of a complex signal?: As the title says, if a complex number is A=x + yj, how do I find the amplitude r and the angle Sita? Thanks; eeleader-mcu FPGA/CPLD

Protel_DXP_2004—Classic Tutorial: Protel_DXP_2004—Classic tutorial, really classic; 霖笑 PCB Design

Recommended Content

Hot VideosMore

Hot ArticlesMore

Circuit

可能感兴趣器件

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews

Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京B2-20211791 京ICP备10001474号-1 电信业务审批[2006]字第258号函

京公网安备 11010802033920号