Skip to main content

Flood-Fill Algorithm to fill different types of geometric shapes In C Programming


#include< stdio.h>
#include< conio.h>
#include< graphics.h>
void floodFill4(int,int,int,int);
void floodFill8(int,int,int,int);
void main()
{
 int gd=DETECT,gm;
 int b=0;
 initgraph(&gd,&gm,"");

 setbkcolor(b);
 setcolor(BLUE);
 outtextxy(5,5,"Flood Filling algorithm using 4-connected and 8-connected");
 line(100,100,50,100);
 setcolor(RED);
 line(100,100,100,150);
 setcolor(BLUE);
 line(100,150,50,150);
 setcolor(GREEN);
 line(50,100,50,150);
 floodFill8(53,102,14,b);

 setcolor(GREEN);
 circle(200,200,30);
 setcolor(RED);
 circle(200,200,50);
 floodFill4(200,240,5,b);


getch();
}

void floodFill4(int x,int y,int fill,int old)
{
 int current;
 current=getpixel(x,y);
 //delay(100);
 if(current==old)
 {
  putpixel(x,y,fill);
  floodFill4(x+1,y,fill,old);
  floodFill4(x-1,y,fill,old);
  floodFill4(x,y-1,fill,old);
  floodFill4(x,y+1,fill,old);
 }
}
void floodFill8(int x,int y,int fill,int old)
{
 int current;
 current=getpixel(x,y);
 if(current==old)
 {

  putpixel(x,y,fill);
  floodFill8(x+1,y,fill,old);
  floodFill8(x-1,y,fill,old);
  floodFill8(x,y-1,fill,old);
  floodFill8(x,y+1,fill,old);
  floodFill8(x+1,y+1,fill,old);
  floodFill8(x-1,y+1,fill,old);
  floodFill8(x-1,y-1,fill,old);
  floodFill8(x+1,y-1,fill,old);
 }
}


OUTPUT

Comments

Popular posts from this blog

First Come First Serve (FCFS) Page replacement algorithm in C Programming

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 4 2 3 1 | 4 1 3 2 | 4 1 2 5 | 5 1 2 1 | 5 1 2 2 | 5 1 2 3 | 5 3 2 4 | 5 3 4 5 | 5 3 4 ---------------------------...

Deadlock Prevention using Banker’s Algorithm in C Programming

#include #include void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i OUTPUT Enter number of process:5 Enter number of resources:3 Enter total numbers of each resources:10 5 7 Enter Max resources for each process: for process 1:7 5 3 for process 2:3 2 2 for process 3:9 0 2 for process 4:2 2 2 for process 5:4 3 3 Enter allocated resources for each process: for process 1:0 1 0 for process 2:3 0 2 for process 3:3 0 2 for process 4:2 1 1 for process 5:0 0 2 available resources: 2 3 0 Allocated matrix Max need 0 1 0| 7 5 3| 7 4 3 3 0 2| 3 2 2| 0 2 0 3 0 2| 9 0 2| 6 0 0 2 1 1| ...

Knapsack Using Backtracking in C Programming

#include #include #define MAX 20 float final_profit; int w[MAX]; int p[MAX]; int n,m; int temp[MAX],x[MAX]; float final_wt; float Bound_Calculation(int,int,int); void BackTracking(int,int,int); void main() { int i; clrscr(); printf("\n-------------------------------------------------------"); printf("\n KNAPSACK PROBLEM USING BACKTRACKING"); printf("\n-------------------------------------------------------"); printf("\n Enter number of Objects you want:"); scanf("%d",&n); printf("\n-------------------------------------------------------"); for(i=1;i final_profit)&&(k==n)) { final_profit=new_cp; final_wt=new_cw; for(j=1;j =final_profit) { temp[k]=0; if(k final_profit)&&(k==n)) { final_profit=cp; final_wt=cw; for(j=1;j OUTPUT ------------------------------------------------------- KNAPSACK PROBLEM USING BACKTRACKING -------------------------------------...