qq_42811420的博客

from openpyxl import load_workbook# 得到日增长率，净值，def getdata(path,bfb): datalist = [] pricelist = [] workbook = load_workbook(filename=path) sheet = workbook.active length = int(sheet.dimensions.split(':')[1][1:]) for i in range(2,i

数据结构思维导图(笔记里包含源码)总体基础线性表栈队列广义表串树图算法查找排序

迪杰斯特拉-最短路径问题具体代码#include<stdio.h>#define SIZE 110 #define INF 1000000int Dijkstra(int map[][SIZE],int from,int to,int vexnum){ int visit[SIZE]; int len[SIZE]; for(int i=1;i<=vexnum;...

背包问题（0-1）具体代码#include<stdio.h>#define MAXSIZE 8void bag(int value[MAXSIZE],int weight[MAXSIZE],int up){ int pre[MAXSIZE]={0},j,maxsum,x,tempsum=0,res[MAXSIZE],k=0,sum=0; for(int i=0;i<...

克鲁斯卡尔-最小生成树具体代码#include<stdio.h>#define MAXEDGE 100#define MAXVERTEX 100typedef struct Edge{ int begin;//边的起点 int end; //边的终点 int wight;//边的权值}Edge; typedef struct Graph{ char ve...

普里姆-最短路径具体代码#include<stdio.h> #define MAX 10 int graph[MAX][MAX];void Prim(int graph[][MAX],int vexnum){ int lowcast[MAX],mst[MAX]; for(int i=1;i<=vexnum;i++){ mst[i]=1; lowca...

拓扑排序具体代码#include<stdio.h>#include<stdlib.h>#define MAX 20int ve[MAX];//最早时间int vl[MAX];//最晚时间 typedef struct ArcNode{ int adjvex; struct ArcNode *nextarc; int weight;}ArcNode;...

KMP算法具体代码#include<stdio.h>void GetNext(char target[],int *next,int tnum){ int j=0,k=-1; next[0]=-1; while(j<tnum){ if(k==-1||target[j]==target[k]){ next[++j]=++k; }else{ k=ne...

八大排序具体代码#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include <time.h>#define MIN 10#define MAX 100void Print(int arr[],int size){ for(...