gdata.io.handleScriptLoaded({"version":"1.0","encoding":"UTF-8","feed":{"xmlns":"http://www.w3.org/2005/Atom","xmlns$openSearch":"http://a9.com/-/spec/opensearchrss/1.0/","xmlns$gd":"http://schemas.google.com/g/2005","xmlns$georss":"http://www.georss.org/georss","xmlns$thr":"http://purl.org/syndication/thread/1.0","xmlns$blogger":"http://schemas.google.com/blogger/2008","id":{"$t":"tag:blogger.com,1999:blog-913600556879440043"},"updated":{"$t":"2024-01-01T15:38:08.302+05:30"},"category":[{"term":"Data Structures"},{"term":"Vedic Mathematics"},{"term":"My Vlogs"},{"term":"Website Designing"},{"term":"Guest Blogging"},{"term":"Youtube"},{"term":"PPL"},{"term":"Android"},{"term":"Android App Development"},{"term":"High Performance Computing"},{"term":"Socket Programming"},{"term":"Java"},{"term":"Cloud Computing"},{"term":"Unboxing \u0026 Review"},{"term":"Database"},{"term":"OpenMPI"},{"term":"OPENCL"},{"term":"CUDA"},{"term":"LEX \u0026 YACC"},{"term":"Vocabulary"},{"term":"Compiler"},{"term":"Blogging Tips"},{"term":"Networking"},{"term":"Linux"},{"term":"Nanded City Pune"},{"term":"Parallel Computing"},{"term":"SDL"},{"term":"Fedora"},{"term":"Udemy Courses"},{"term":"Dia Software"},{"term":"MPI"},{"term":"Multithreading"},{"term":"Computer Networks"},{"term":"Abbreviations in Computer Science"},{"term":"Salesforce"},{"term":"Lisp"},{"term":"YouTube Tips"},{"term":"MS Excel Formulas \u0026 Functions"},{"term":"C Plus Plus Programming"},{"term":"GATE"},{"term":"Mysql"},{"term":"Google Forms"},{"term":"Wine"},{"term":"Swing"},{"term":"Mathematics"},{"term":"SQL"},{"term":"Amazon Links Summary"},{"term":"Thread Pool"},{"term":"General"},{"term":"Amazon Affiliate Program"},{"term":"How To Write Blog"},{"term":"C Programming"},{"term":"Applet"},{"term":"Selenium Automation Testing"},{"term":"Skill Development Lab"},{"term":"OPENMP"},{"term":"Python"},{"term":"Ubuntu"}],"title":{"type":"text","$t":"Computer Revolution (www.comrevo.com)"},"subtitle":{"type":"html","$t":""},"link":[{"rel":"http://schemas.google.com/g/2005#feed","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/-/High+Performance+Computing?alt\u003djson-in-script\u0026max-results\u003d6"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/-/High+Performance+Computing?alt\u003djson-in-script\u0026max-results\u003d6"},{"rel":"alternate","type":"text/html","href":"http://www.comrevo.com/search/label/High%20Performance%20Computing"},{"rel":"hub","href":"http://pubsubhubbub.appspot.com/"},{"rel":"next","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/-/High+Performance+Computing/-/High+Performance+Computing?alt\u003djson-in-script\u0026start-index\u003d7\u0026max-results\u003d6"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"generator":{"version":"7.00","uri":"https://www.blogger.com","$t":"Blogger"},"openSearch$totalResults":{"$t":"62"},"openSearch$startIndex":{"$t":"1"},"openSearch$itemsPerPage":{"$t":"6"},"entry":[{"id":{"$t":"tag:blogger.com,1999:blog-913600556879440043.post-6249281443407385822"},"published":{"$t":"2021-03-03T14:50:00.002+05:30"},"updated":{"$t":"2021-03-03T14:50:51.894+05:30"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"High Performance Computing"},{"scheme":"http://www.blogger.com/atom/ns#","term":"PPL"}],"title":{"type":"text","$t":"Von Neumann Architecture in Computer Organization | Von Neumann Model in Computer Architecture"},"content":{"type":"html","$t":"\u003cp\u003e\u0026nbsp;\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;In this post, we will see\u0026nbsp;Von Neumann Architecture in Computer Organization | Von Neumann Model in Computer Architecture | von neumann architecture,von neumann,von neumann model in computer architecture,von neumann architecture in computer organization,von neumann model,von neumann machine,von neumann architecture in english,von neumann computer architecture\u0026nbsp;\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eWatch following video:\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\n  \n  \u003ciframe allow\u003d\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen\u003d\"\" frameborder\u003d\"0\" height\u003d\"360\" src\u003d\"https://www.youtube.com/embed/ssT8PCbOnQc\" width\u003d\"640\"\u003e\u003c/iframe\u003e\n  \n  \u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cb\u003eWatch on YouTube:\u0026nbsp;\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dssT8PCbOnQc\" target\u003d\"_blank\"\u003ehttps://www.youtube.com/watch?v\u003dssT8PCbOnQc\u003c/a\u003e\u003c/b\u003e\u003c/span\u003e\u003c/p\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comrevo.com/feeds/6249281443407385822/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comrevo.com/2021/03/von-neumann-architecture-in-computer-organization-.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/6249281443407385822"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/6249281443407385822"},{"rel":"alternate","type":"text/html","href":"https://www.comrevo.com/2021/03/von-neumann-architecture-in-computer-organization-.html","title":"Von Neumann Architecture in Computer Organization | Von Neumann Model in Computer Architecture"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"https://i.ytimg.com/vi/ssT8PCbOnQc/default.jpg","height":"72","width":"72"},"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-913600556879440043.post-5707772073040909412"},"published":{"$t":"2021-01-04T23:14:00.001+05:30"},"updated":{"$t":"2021-01-04T23:14:35.511+05:30"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"High Performance Computing"}],"title":{"type":"text","$t":"Parallel Best First Search Algorithm in Artificial Intelligence With Example | Parallel Formulation"},"content":{"type":"html","$t":"\u003cp\u003e\u0026nbsp;\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;In this post, we will see\u0026nbsp;Parallel Best First Search Algorithm in Artificial Intelligence With Example | Parallel Formulation | parallel best first search algorithm,best first search in artificial intelligence,best first search,best first search algorithm,best first search algorithm in artificial intelligence,best first search in artificial intelligence in english,best first search example,best first search in ai with example,best first search greedy\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eBest First Search Algorithm :\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003ca href\u003d\"https://youtu.be/QZiJScjiHZA\"\u003ehttps://youtu.be/QZiJScjiHZA\u003c/a\u003e\u0026nbsp;\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eWatch following video:\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\n  \n  \u003ciframe allow\u003d\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen\u003d\"\" frameborder\u003d\"0\" height\u003d\"360\" src\u003d\"https://www.youtube.com/embed/nR-au2YQg3Q\" width\u003d\"640\"\u003e\u003c/iframe\u003e\n  \n  \u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cb\u003eWatch on YouTube:\u0026nbsp;\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dnR-au2YQg3Q\" target\u003d\"_blank\"\u003ehttps://www.youtube.com/watch?v\u003dnR-au2YQg3Q\u003c/a\u003e\u003c/b\u003e\u003c/span\u003e\u003c/p\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comrevo.com/feeds/5707772073040909412/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comrevo.com/2021/01/parallel-best-first-search-algorithm-in-artificial-intelligence-with-example.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/5707772073040909412"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/5707772073040909412"},{"rel":"alternate","type":"text/html","href":"https://www.comrevo.com/2021/01/parallel-best-first-search-algorithm-in-artificial-intelligence-with-example.html","title":"Parallel Best First Search Algorithm in Artificial Intelligence With Example | Parallel Formulation"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"https://i.ytimg.com/vi/nR-au2YQg3Q/default.jpg","height":"72","width":"72"},"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-913600556879440043.post-1820873078024636239"},"published":{"$t":"2021-01-04T09:54:00.007+05:30"},"updated":{"$t":"2021-01-04T09:54:58.730+05:30"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"Data Structures"},{"scheme":"http://www.blogger.com/atom/ns#","term":"High Performance Computing"}],"title":{"type":"text","$t":"Best First Search Algorithm in Artificial Intelligence | Best First Search in AI With Example"},"content":{"type":"html","$t":"\u003cp\u003e\u0026nbsp;\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; In this post, we will see\u0026nbsp;Best First Search Algorithm in Artificial Intelligence | Best First Search in AI With Example\u0026nbsp; | best first search in artificial intelligence,best first search,best first search algorithm,best first search algorithm in artificial intelligence,best first search in artificial intelligence in english,best first search example,best first search in ai with example,best first search greedy\u0026nbsp;\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eWatch following video:\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\n  \n  \u003ciframe allow\u003d\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen\u003d\"\" frameborder\u003d\"0\" height\u003d\"360\" src\u003d\"https://www.youtube.com/embed/QZiJScjiHZA\" width\u003d\"640\"\u003e\u003c/iframe\u003e\n  \n  \n  \u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cb\u003eWatch on YouTube:\u0026nbsp;\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dQZiJScjiHZA\" target\u003d\"_blank\"\u003ehttps://www.youtube.com/watch?v\u003dQZiJScjiHZA\u003c/a\u003e\u003c/b\u003e\u003c/span\u003e\u003c/p\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comrevo.com/feeds/1820873078024636239/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comrevo.com/2021/01/best-first-search-algorithm-in.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/1820873078024636239"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/1820873078024636239"},{"rel":"alternate","type":"text/html","href":"https://www.comrevo.com/2021/01/best-first-search-algorithm-in.html","title":"Best First Search Algorithm in Artificial Intelligence | Best First Search in AI With Example"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"https://i.ytimg.com/vi/QZiJScjiHZA/default.jpg","height":"72","width":"72"},"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-913600556879440043.post-6699222088396979871"},"published":{"$t":"2021-01-03T22:59:00.001+05:30"},"updated":{"$t":"2021-01-03T22:59:06.594+05:30"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"High Performance Computing"}],"title":{"type":"text","$t":"Depth First Search Parallel Algorithm | Parallel Depth First Search Algorithm | Parallel DFS"},"content":{"type":"html","$t":"\u003cp\u003e\u0026nbsp;\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; In this post, we will see\u0026nbsp;Depth First Search Parallel Algorithm | Parallel Depth First Search Algorithm | Parallel DFS | depth first search parallel algorithm,depth first search parallel,parallel depth first search algorithm,parallel depth first search,parallel dfs,parallel dfs algorithm,depth first search,depth first search algorithm,depth first search in data structure,depth first traversal graph,depth first traversal,breadth first search and depth first search,depth first search in daa,depth first search graph,depth first traversal in data structure,bfs and dfs,dfs algorithm,bfs and dfs in data structures,dfs in data structure,dfs traversal of graph,bfs and dfs in daa,dfs in graph\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eDepth First Search Algorithm Using Stack in Data Structure | DFS Graph Traversal in Graph Theory\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dw1LcC-Lqhio\"\u003ehttps://www.youtube.com/watch?v\u003dw1LcC-Lqhio\u003c/a\u003e\u0026nbsp;\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eWatch following video:\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\n  \n  \u003ciframe allow\u003d\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen\u003d\"\" frameborder\u003d\"0\" height\u003d\"360\" src\u003d\"https://www.youtube.com/embed/OtcEmt_2TJQ\" width\u003d\"640\"\u003e\u003c/iframe\u003e\n  \n  \n  \u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cb\u003eWatch on YouTube:\u0026nbsp;\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dOtcEmt_2TJQ\u0026amp;t\u003d303s\" target\u003d\"_blank\"\u003ehttps://www.youtube.com/watch?v\u003dOtcEmt_2TJQ\u0026amp;t\u003d303s\u003c/a\u003e\u003c/b\u003e\u003c/span\u003e\u003c/p\u003e\u003cdiv\u003e\u003cbr /\u003e\u003c/div\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comrevo.com/feeds/6699222088396979871/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comrevo.com/2021/01/depth-first-search-parallel-algorithm-parallel-dfs.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/6699222088396979871"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/6699222088396979871"},{"rel":"alternate","type":"text/html","href":"https://www.comrevo.com/2021/01/depth-first-search-parallel-algorithm-parallel-dfs.html","title":"Depth First Search Parallel Algorithm | Parallel Depth First Search Algorithm | Parallel DFS"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"https://i.ytimg.com/vi/OtcEmt_2TJQ/default.jpg","height":"72","width":"72"},"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-913600556879440043.post-8667923798284393478"},"published":{"$t":"2020-12-26T23:21:00.003+05:30"},"updated":{"$t":"2020-12-26T23:21:56.524+05:30"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"Data Structures"},{"scheme":"http://www.blogger.com/atom/ns#","term":"High Performance Computing"}],"title":{"type":"text","$t":"Depth First Search Algorithm Using Stack in Data Structure | DFS Graph Traversal in Graph Theory"},"content":{"type":"html","$t":"\u003cp\u003e\u0026nbsp;\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;In this video, we will see\u0026nbsp;Depth First Search Algorithm Using Stack in Data Structure | DFS Graph Traversal in Graph Theory | depth first search,depth first search algorithm,depth first search in data structure,depth first traversal graph,depth first traversal,breadth first search and depth first search,depth first search in daa,depth first search graph,depth first traversal in data structure,bfs and dfs,dfs algorithm,bfs and dfs in data structures,dfs in data structure,dfs traversal of graph,bfs and dfs in daa,dfs in graph\u0026nbsp;\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cbr /\u003e\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003eWatch following video:\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\n  \n  \n  \u003ciframe allow\u003d\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen\u003d\"\" frameborder\u003d\"0\" height\u003d\"360\" src\u003d\"https://www.youtube.com/embed/w1LcC-Lqhio\" width\u003d\"640\"\u003e\u003c/iframe\u003e\n  \n  \n  \u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cb\u003eWatch on YouTube:\u0026nbsp;\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dw1LcC-Lqhio\" target\u003d\"_blank\"\u003ehttps://www.youtube.com/watch?v\u003dw1LcC-Lqhio\u003c/a\u003e\u003c/b\u003e\u003c/span\u003e\u003c/p\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comrevo.com/feeds/8667923798284393478/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comrevo.com/2020/12/depth-first-search-algorithm-using-stack-in-data-structure.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/8667923798284393478"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/8667923798284393478"},{"rel":"alternate","type":"text/html","href":"https://www.comrevo.com/2020/12/depth-first-search-algorithm-using-stack-in-data-structure.html","title":"Depth First Search Algorithm Using Stack in Data Structure | DFS Graph Traversal in Graph Theory"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"https://i.ytimg.com/vi/w1LcC-Lqhio/default.jpg","height":"72","width":"72"},"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-913600556879440043.post-8815670689346353707"},"published":{"$t":"2020-12-26T23:18:00.001+05:30"},"updated":{"$t":"2020-12-26T23:18:36.711+05:30"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"Data Structures"},{"scheme":"http://www.blogger.com/atom/ns#","term":"High Performance Computing"}],"title":{"type":"text","$t":"Breadth First Search Algorithm Using Queue in Data Structure | BFS Graph Traversal in Graph Theory"},"content":{"type":"html","$t":"\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; In this post, we will see\u0026nbsp;Breadth First Search Algorithm Using Queue in Data Structure | BFS Graph Traversal in Graph Theory | breadth first search,breadth first search algorithm,breadth first search in data structure,breadth first traversal graph,breadth first traversal,breadth first search and depth first search,breadth first search in daa,breadth first search graph,breadth first traversal in data structure,bfs and dfs,bfs algorithm,bfs and dfs in data structures,bfs in data structure,bfs traversal of graph,bfs and dfs in daa,bfs in graph\u0026nbsp;\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cbr /\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u0026nbsp;Watch following video:\u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\n  \n  \u003ciframe allow\u003d\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen\u003d\"\" frameborder\u003d\"0\" height\u003d\"360\" src\u003d\"https://www.youtube.com/embed/xYacvV1i_ao\" width\u003d\"640\"\u003e\u003c/iframe\u003e\n  \n  \n  \u003c/span\u003e\u003c/p\u003e\u003cp\u003e\u003cspan style\u003d\"font-size: large;\"\u003e\u003cb\u003eWatch on YouTube:\u0026nbsp;\u003ca href\u003d\"https://www.youtube.com/watch?v\u003dxYacvV1i_ao\" target\u003d\"_blank\"\u003ehttps://www.youtube.com/watch?v\u003dxYacvV1i_ao\u003c/a\u003e\u003c/b\u003e\u003c/span\u003e\u003c/p\u003e"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://www.comrevo.com/feeds/8815670689346353707/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://www.comrevo.com/2020/12/breadth-first-search-algorithm-using-queue-in-data-structure.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/8815670689346353707"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/913600556879440043/posts/default/8815670689346353707"},{"rel":"alternate","type":"text/html","href":"https://www.comrevo.com/2020/12/breadth-first-search-algorithm-using-queue-in-data-structure.html","title":"Breadth First Search Algorithm Using Queue in Data Structure | BFS Graph Traversal in Graph Theory"}],"author":[{"name":{"$t":"Parag Jambhulkar"},"uri":{"$t":"https://www.blogger.com/profile/13991750622483538113"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"https://i.ytimg.com/vi/xYacvV1i_ao/default.jpg","height":"72","width":"72"},"thr$total":{"$t":"0"}}]}});