⭐ 欢迎来到虫虫下载站！ | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站
📤 上传资源

📄 testme.c

📁 稀疏矩阵、链表、图、队列、二叉树、多叉树、排序、遗传算法等的实现
💻 C
📖 第 1 页 / 共 2 页
字号:
🔍
12 
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)0);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)0);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)0);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  fprintf(stdout, "* Retrieving a node at (0,0)\n");
  node = sp_retrieve_node(&sp, &my_tuple);
  if ((sp.error_no != SP_NOERR) || (node == (SP_NODE *)NULL))
  {
    fprintf(stderr, "test_sparse: Unable to retrieve node\n");
    print_sparse(&sp);
    return;
  }
  print_node(node, (int)2);
  fprintf(stdout, "* Filling out matrix to 6x6\n");
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)0);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)1);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)1);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)0);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)2);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)2);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)0);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)3);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)3);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)0);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)4);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)4);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)0);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)5);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)5);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)1);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)0);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)10);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)1);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)2);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)12);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)1);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)3);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)13);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)1);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)4);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)14);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)1);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)5);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)15);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)0);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)20);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)1);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)21);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)2);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)22);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)3);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)23);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)4);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)24);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)5);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)25);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)3);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)0);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)30);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)3);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)1);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)31);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)3);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)2);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)32);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)3);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)3);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)33);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)3);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)4);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)34);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)3);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)5);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)35);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)4);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)0);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)40);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)4);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)1);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)41);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)4);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)2);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)42);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)4);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)3);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)43);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)4);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)4);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)44);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)4);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)5);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)45);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)5);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)0);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)50);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)5);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)1);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)51);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)5);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)2);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)52);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)5);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)3);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)53);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)5);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)4);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)54);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
  my_tuple.seq = (int *)NULL;
  tuple_ptr = sp_tuple_dim(&my_tuple, (int)2);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)1, (int)5);
  tuple_ptr = sp_add_tuple(&my_tuple, (int)2, (int)5);
  print_tuple(&my_tuple);
  sp_ptr = sp_ins_node(&sp, &my_tuple, (int)55);
  if (sp.error_no != SP_NOERR)
  {
    fprintf(stderr, "test_sparse: Failure to insert\n");
    print_sparse(&sp);
    return;
  }
/*WBF*/

  return;
}

int main()
{
  tuple_test();
  header_test();
  sparse_test();
  return (0);
}
12

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -