csucbMIT的博客

5-1 Build A Binary Search Tree   (30分)A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with ke

使用Tarjan算法完成的题目，同时向图灵奖获得者致敬

堆排序和插入排序之间的区别程序题

一道简单的归并排序题

DFS算法的应用

承接上一篇博客，展示另一道PTA问题   4-2 Shortest Path [4]   (25分) Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one mini

作为一名小白，最近学习了Dijkstra算法，对于最短路径的解有了一定的认识，从PTA的题目来说明Dijkstra算法4-1 Shortest Path [3]   (25分) Write a program to not only find the weighted shortest distances, but also count the number of differen

5-1 File Transfer   (30分)We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to

Write a program to find the topological order in a digraph.Format of functions:bool TopSort( LGraph Graph, Vertex TopOrder[] );where LGraph is defined as the following:typedef struct AdjVNode

在学习数据结构树结构时，遇到求解树高度的问题，附上递归法求解树高度。typedef struct TNode *BinTree;struct TNode{ int Key; BinTree Left; BinTree Right;};int heightf(BinTree T){ int left = 0, right = 0; if(T -

4-1 Percolate Up and Down   (20分)Write the routines to do a "percolate up" and a "percolate down" in a binary min-heap.Format of functions:void PercolateUp( int p, PriorityQueue H );void Pe

For a given undirected graph with N vertices and E edges, please list all the connected components by both DFS (Depth First Search) and BFS (Breadth First Search). Assume that all the vertices are num