<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>graph | Student Projects</title>
	<atom:link href="https://studentprojects.in/tag/graph/feed/" rel="self" type="application/rss+xml" />
	<link>https://studentprojects.in</link>
	<description>Microcontroller projects, Circuit Diagrams, Project Ideas</description>
	<lastBuildDate>Thu, 11 Mar 2010 16:50:46 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.1.7</generator>
	<item>
		<title>C++ programs for the implementation of Depth-first search(DFS) for a given graph</title>
		<link>https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-depth-first-searchdfs-for-a-given-graph/</link>
					<comments>https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-depth-first-searchdfs-for-a-given-graph/#comments</comments>
		
		<dc:creator><![CDATA[Editorial Team]]></dc:creator>
		<pubDate>Thu, 11 Mar 2010 16:50:46 +0000</pubDate>
				<category><![CDATA[Data structure]]></category>
		<category><![CDATA[Datastructure]]></category>
		<category><![CDATA[DFS]]></category>
		<category><![CDATA[Depth-first search]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[C Programs]]></category>
		<guid isPermaLink="false">http://studentprojects.in/?p=1019</guid>

					<description><![CDATA[<p>/* Write C++ programs for the implementation of Depth-first search(DFS) for a given graph */ #include #include #include using namespace std; int cost[10][10],i,j,k,n,stk[10],top,v,visit[10],visited[10]; main() { int m; cout n; cout m; cout >j; cost[i][j]=1; } cout v; cout</p>
<p>The post <a href="https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-depth-first-searchdfs-for-a-given-graph/">C++ programs for the implementation of Depth-first search(DFS) for a given graph</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></description>
										<content:encoded><![CDATA[<p>/* Write C++ programs for the implementation of Depth-first search(DFS) for a given graph */</p>
<pre lang="cpp">
#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;
int cost[10][10],i,j,k,n,stk[10],top,v,visit[10],visited[10];

main()
{
int m;
cout <<"enterno of vertices";
cin >> n;
cout <<"ente no of edges";
cin >> m;
cout <<"\nEDGES \n";
for(k=1;k<=m;k++)
{
cin >>i>>j;
cost[i][j]=1;
}

cout <<"enter initial vertex";
cin >>v;
cout <<"ORDER OF VISITED VERTICES";
cout << v <<" ";
visited[v]=1;
k=1;
while(k<n)
{
for(j=n;j>=1;j--)
if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1)
{
visit[j]=1;
stk[top]=j;
top++;
}
v=stk[--top];
cout<<v << " ";
k++;
visit[v]=0; visited[v]=1;
}
}
</pre>
<p><strong>OUTPUT</strong></p>
<p>enterno of vertices9<br />
ente no of edges9</p>
<p>EDGES<br />
1 2<br />
2 3<br />
2 6<br />
1 5<br />
1 4<br />
4 7<br />
5 7<br />
7 8<br />
8 9<br />
enter initial vertex1<br />
ORDER OF VISITED VERTICES1 2 3 6 4 7 8 9 5</p><p>The post <a href="https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-depth-first-searchdfs-for-a-given-graph/">C++ programs for the implementation of Depth-first search(DFS) for a given graph</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></content:encoded>
					
					<wfw:commentRss>https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-depth-first-searchdfs-for-a-given-graph/feed/</wfw:commentRss>
			<slash:comments>31</slash:comments>
		
		
			</item>
		<item>
		<title>C Program to impliment Fish Movement</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/graphics/c-program-to-impliment-fish-movement/</link>
					<comments>https://studentprojects.in/software-development/c-tutorials/c/graphics/c-program-to-impliment-fish-movement/#comments</comments>
		
		<dc:creator><![CDATA[Editorial Team]]></dc:creator>
		<pubDate>Fri, 02 Oct 2009 08:31:10 +0000</pubDate>
				<category><![CDATA[Graphics]]></category>
		<category><![CDATA[cleardevice]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[set color]]></category>
		<category><![CDATA[c graphics]]></category>
		<category><![CDATA[bgi]]></category>
		<category><![CDATA[fish movment]]></category>
		<category><![CDATA[fish graphics]]></category>
		<category><![CDATA[kbhit]]></category>
		<category><![CDATA[arc]]></category>
		<category><![CDATA[circle]]></category>
		<category><![CDATA[initgraph]]></category>
		<guid isPermaLink="false">http://studentprojects.in/?p=814</guid>

					<description><![CDATA[<p>x+=5;<br />
y+=1;<br />
arc(x,y,stangle,endangle+35,radius);<br />
arc(x,y-110,190,323,radius+2);<br />
circle(x+40,y-60,5);<br />
line(x-90,y-90,x-90,y-8);</p>
<p>The post <a href="https://studentprojects.in/software-development/c-tutorials/c/graphics/c-program-to-impliment-fish-movement/">C Program to impliment Fish Movement</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></description>
										<content:encoded><![CDATA[<pre lang="c" escaped="true" line="1">
#include<stdio.h>
#include<time.h>
#include<conio.h>
#include<stdlib.h>
#include<dos.h>
#include<graphics.h>

void main()
{
	int gd=DETECT,gm;
	int x=10,y=200,x1=675,y1=380;
	int stangle=35,endangle=140,radius=90;

	initgraph(&gd,&gm,"..\\bgi");

	while(!kbhit())
	{
		cleardevice();
		setbkcolor(BLACK);

		if(x<640)
		{
			x+=5;
			y+=1;
			arc(x,y,stangle,endangle+35,radius);
			arc(x,y-110,190,323,radius+2);
			circle(x+40,y-60,5);
			line(x-90,y-90,x-90,y-8);
		}
		else
		{
			x1-=5;
			y1-=1;
			arc(x1,y1,stangle-30,endangle+4,radius);
			arc(x1,y1-110,217,350,radius+2);
			circle(x1-40,y1-60,5);
			line(x1+90,y1-90,x1+90,y1-10);
		}
		setcolor(YELLOW);
		delay(90);
	}
	closegraph();
}
</pre><p>The post <a href="https://studentprojects.in/software-development/c-tutorials/c/graphics/c-program-to-impliment-fish-movement/">C Program to impliment Fish Movement</a> first appeared on <a href="https://studentprojects.in">Student Projects</a>.</p>]]></content:encoded>
					
					<wfw:commentRss>https://studentprojects.in/software-development/c-tutorials/c/graphics/c-program-to-impliment-fish-movement/feed/</wfw:commentRss>
			<slash:comments>6</slash:comments>
		
		
			</item>
	</channel>
</rss>
