No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
Given a n*n grid with free spaces and obstacles in the form an n*n integer matrix. We need to find shortest between any two given points (x1,y1) and (x2,y2) through the free spaces. We are not allowed to move in diagonal. Please help me figuring out an algorithm for doing … 
|
|
|
Hi... I have the following code... [code=php] case 10: if($uid=$_GET['u'] && $pid=$_GET['p'] && $t=$_GET['ti'] && $type=$_GET['typ']) { print "$uid $pid $t $type "; } $query1="select * from album"; $result1=mysql_query($query1); if(mysql_num_rows($result1)>0) { $i=1; print "<table width='1000px' cellspacing='10px' cellpadding='10px' align='center'><tr><td colspan='4' class='h1'>Click on an image to delete it..</td></tr><tr>"; while($row1=mysql_fetch_array($result1)) { $query3="select * …
|