﻿<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><copyright>Copyright 2003-2026 Bug &amp; dizzy.hr</copyright><ttl>30</ttl><pubDate>Thu, 30 Apr 2026 14:14:28 GMT</pubDate><managingEditor>pisma@bug.hr</managingEditor><language>hr</language><lastBuildDate>Sat, 26 Feb 2011 22:13:29 GMT</lastBuildDate><description>Tema unutar podforuma Programiranje</description><title>C++, optimalna putanja (BFS)</title><link>http://forum.bug.hr/forum/topic/programiranje/c-optimalna-putanja-bfs/90181.aspx</link><image><url>http://www.bug.hr/images/forum-rss.gif</url></image><item><title>C++, optimalna putanja (BFS)</title><description>Gle fakat...Ajme majko kako jednostavno,stvarno sam debos.hvala puno na pomoci :D</description><link>http://forum.bug.hr/forum/post/programiranje/c-optimalna-putanja-bfs/1732291.aspx</link><pubDate>Sat, 26 Feb 2011 22:13:29 GMT</pubDate><guid isPermaLink="false">83729dfcbac84aa34d906898524bed93</guid><category /></item><item><title>Re: C++, optimalna putanja (BFS)</title><description>Tako je, da fali popanje XD.&amp;nbsp; Ajmo reci da imamo ovakvu mapu.&amp;nbsp; ....x......pako krecemo od x "bio[][]" izgleda ovako:123401231234&amp;nbsp; sada znamo koordinate od p. krecemo od p i moramo ici s...</description><link>http://forum.bug.hr/forum/post/programiranje/c-optimalna-putanja-bfs/1732272.aspx</link><pubDate>Sat, 26 Feb 2011 22:09:12 GMT</pubDate><guid isPermaLink="false">ab1fa66004e1dc158c28a4ea72228cbd</guid><category /></item><item><title>C++, optimalna putanja (BFS)</title><description>...find_path bas ne razumijen(moze malo objasnjenje?),i tamo gore mislim da fali popanje Q-ua.
fala :D</description><link>http://forum.bug.hr/forum/post/programiranje/c-optimalna-putanja-bfs/1732250.aspx</link><pubDate>Sat, 26 Feb 2011 22:01:53 GMT</pubDate><guid isPermaLink="false">5d9a9f011aadb1d6d98ee292c9879718</guid><category /></item><item><title>Re: C++,optimalna putanja(BFS)</title><description>Koristimo strukturu Q u C++.&amp;nbsp; imamo bio[Max_row][Max_col], sve postavimo na -1 to znaci da nismo nikada bili.&amp;nbsp; queue &amp;lt; pair &amp;lt; int, int &amp;gt; &amp;gt; Q;tako inicijaliziramo Q. u koji sprema...</description><link>http://forum.bug.hr/forum/post/programiranje/c-optimalna-putanja-bfs/1731421.aspx</link><pubDate>Sat, 26 Feb 2011 17:57:56 GMT</pubDate><guid isPermaLink="false">b19ae6a470132171f7bb67509548cf39</guid><category /></item><item><title>C++,optimalna putanja(BFS)</title><description>Recimo da imamo neku matricu mat koja sadrzi charove, sa R redaka i S stupacaSvako polje moze sadrzavati ,'S'(start),'K'(kraj),'.'(Prazno polje) ili '#'(zid).Moje pitanje je : nakon unosa R-a,S-a i ma...</description><link>http://forum.bug.hr/forum/post/programiranje/c-optimalna-putanja-bfs/1730695.aspx</link><pubDate>Sat, 26 Feb 2011 14:26:53 GMT</pubDate><guid isPermaLink="false">88ef5361c79415809f9688cb507be447</guid><category /></item></channel></rss>