数据结构基础
JiahanZ
这个作者很懒,什么都没留下…
展开
-
FDS - Week 4
Level-order Traversal; Isomorphic; Inorder and postorder traversal of binary tree原创 2016-10-21 12:46:17 · 514 阅读 · 0 评论 -
FDS Week 8: Topological Sort
Topological Sort简单方法:时间复杂度(Nv)^2bool TopSort( LGraph Graph, Vertex TopOrder[] ) { PtrToAdjVNode temp = (PtrToAdjVNode)malloc(sizeof(PtrToAdjVNode)); int Indegree[MaxVertexNum]={0}; int i;原创 2016-12-01 22:12:46 · 349 阅读 · 0 评论 -
FDS - Project2
关于结构体的.h和.c#ifndef _stack_H #define _stack_H typedef struct st *Stack; typedef int ElementType; struct st{ int Capacity; int Top; ElementType *Array; }; int IsEmpty(Stack S); Stack CreateSt原创 2016-11-23 20:16:44 · 473 阅读 · 0 评论