graphni dasturlash

powerpoint taqdimoti grafni to’liq aylanib chiqish. bfs va dfs algoritmlari. 1-daraja 2-daraja queue dfs algoritmi algoritm 1.istalgan tugunni tanlang. agar u tugunga tashrif buyurilmagan bo'lsa, uni tashrif buyurilgan deb belgilang va uning barcha qo'shni tugunlarida ushbu ishni takrorlang. 2.barcha tugunlarga tashrif buyurilguncha yoki qidiriladigan tugun topilmaguncha takrorlang. o ( v + e ); v – uchlar soni e – qirralar soni dfs algoritmi https://youtube.com/playlist?list=plqm7alhxfyseazgcg7uryjfb nymlti-nh dfs algoritmi graph = { 'a' : ['b','c'], 'b' : ['d', 'e'], 'c' : ['f'], 'd' : [], 'e' : ['f'], 'f' : [] } tashrif = set() # tashrif buyurgan tugunlarni to'plamga joylashtamiz def dfs(tashrif, graph, node): #dfs funksiyamiz if node not in tashrif: print (node) tashrif.add(node) for n...

This file contains 18 pages in PDF format (1.4 MB). To download "graphni dasturlash", click the Telegram button on the left.