Dershy_的博客

#include<iostream> const int N = 50; using namespace std; void creat_matrix(int a[N][N], int n) { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; } bool color_matrix( int color[N],int a[N][N],int n) { for (i

#include<iostream> #include<vector> #include<algorithm> using namespace std; void showtree(int* tree, int n) { cout << "最小生成树为:{"; for (int i = 0; i < n; i += 2) { cout << "(" << tree[i] << "," << t

#include<iostream> #define N 4 #define MATRIX_SIZE 4 using namespace std; void show(int a[MATRIX_SIZE][MATRIX_SIZE]) { for (int i = 0; i < MATRIX_SIZE; i++) { for (int j = 0; j < MATRIX_SIZE; j++) { cout << a[i][j] << " ";

#include<iostream> #include<algorithm> #define N 100 using namespace std; int math=0; typedef struct LNode { int data; LNode* next; }LNode, * LinkList; LinkList InitList(LinkList& L, int n, int* a) { int x; int i = 0; L = (LinkList)mal

#include<iostream> #include<vector> using namespace std; void showtree(int tree[], int n) { cout << "最小生成树为:{"; for (int i = 0; i < n; i += 2) { cout << "(" << tree[i] << "," << tree[i + 1] << ")";

#include<iostream> #include<algorithm> #define N 100 using namespace std; typedef struct LNode { int data; LNode* next; }LNode, * LinkList; LinkList InitList(LinkList& L, int n,int *a) { int x; int i = 0; L = (LinkList)malloc(sizeof(LN