Продолжение приложения а

389. case 1:

390. printf("Search to the right --->");

391. fprintf(fil,"Search to the right --->");

392. if((nst = prpoisk(ik,jk))>=0)

393. {

394. printf("founded\n\r");

395. fprintf(fil,"founded\n");

396. if((top2=(struct cik*)malloc(sizeof(struct cik)))==NULL)

397. abort();

398. if(!topnast1) topnast1=top2;

399. else top3 -> next=top2;

400. top3 = top2;

401. top2 -> next = NULL;

402. top2->ick = ik;

403. top2->jck = jk;

404. ch++;

405. top2->prnapr = 1;

406. pr("top2",top2);

407. napr = 2;

408. jk = nst;

409. perpr = perlev = 0;

410. } // **** IF *******

411. else

412. {

413. fprintf(fil,"Point not found ! Change direction to LEFT\n");

414. napr = 3;

415. perpr = 1;

416. }

417. break;

418. //***************** PRODOLZHENIE 2 POISKA ******************************

419. case 2:

420. printf("Search to the down --->");

421. fprintf(fil,"Search to the down --->");

422. if((nstr=nizpoisk(ik,jk))>=0)

423. {

424. if((top2=(struct cik*)malloc(sizeof(struct cik))) == NULL)

425. abort();

426. printf("founded\n\r"); fprintf(fil,"founded\n");

427. if(!topnast1) topnast1=top2;

428. else top3->next=top2;

429. top3=top2;

430. top2->next=NULL;

431. top2->ick = ik;

432. top2->jck = jk;

433. ch++;

434. top2->prnapr = 2;

435. pr("top2",top2);

436. napr = 3;

437. ik = nstr;