Implementation of polygon filling algorithm

1. #include<iostream.h>
2. #include<conio.h>
3. #include<graphics.h>
4. #include<stdio.h>
5. #include<dos.h>
6. void fill_right(int x,int y); void fill_left(int x,int y); void main()
7. {
8. 
   
9. int x,y,a[10][10]; int gd,gm,n,i; detectgraph(&gd,&gm);
10. initgraph(&gd,&gm,"C:\\TC\\BGI"); cout<<"Enter no of edges of polygon:"; cin>>n;
11. cout<<"\n Enter the coordinates of polygon"; for(i=0;i<n;i++)
12. {
13. cin>>a[i][0]>>a[i][1];
14. }
15. a[n][0]=a[0][0];
16. a[n][1]=a[0][1];
17. cout<<"\n Enter the seed point"; cin>>x>>y;
18. cleardevice(); setcolor(WHITE); for(i=0;i<n;i++)
19. {
20. 
    
21.  
22.  
23. line(a[i][0],a[i][1],a[i+1][0],a[i+1][1]);
24. }
25. fill_right(x,y); fill_left(x-1,y); getch();
26. }
27. void fill_right(int x,int y)    //Right fill
28. {
29. if((getpixel(x,y) != WHITE) && (getpixel(x,y) != RED))
30. {
31. delay(1); putpixel(x,y,RED); fill_right(++x,y); x=x-1; fill_right(x,y+1); fill_right(x,y-1);
32. }
33. }
34. void fill_left(int x,int y) //left fill
35. {
36. if((getpixel(x,y) != WHITE) && (getpixel(x,y) != RED))
37. {
38. putpixel(x,y,RED); delay(1); fill_left(--x,y); x=x+1; fill_left(x,y-1); fill_left(x,y+1);
39. }
40. }

Output: