程序代写代做代考 graph 2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰑􏰄􏰒􏰒􏰋􏰂􏰉 􏰔􏰕 􏰖􏰗􏰃􏰎􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒
Da􏰘a S􏰘􏰗􏰚c􏰘􏰚􏰗e􏰒 and Algo􏰗i􏰘hm􏰒, Fall 2019 Impe􏰗ial College B􏰚􏰒ine􏰒􏰒 School
􏰖􏰗􏰃􏰎􏰈􏰒 􏰃􏰗􏰄 􏰚􏰛􏰋􏰜􏰚􏰋􏰘􏰂􏰚􏰒􏰝 􏰃􏰉􏰐 􏰄􏰞􏰟􏰋􏰄􏰉􏰘􏰏􏰠 􏰒􏰂􏰏􏰌􏰋􏰉􏰍 􏰍􏰗􏰃􏰎􏰈 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰒 􏰋􏰒 􏰟􏰗􏰚􏰟􏰋􏰃􏰏 􏰘􏰂 􏰟􏰂􏰙􏰎􏰃􏰉􏰋􏰄􏰒 􏰊􏰗􏰂􏰙 􏰖􏰂􏰂􏰍􏰏􏰄 􏰘􏰂 􏰡􏰃􏰟􏰄􏰛􏰂􏰂􏰅􏰢 􏰣􏰄 􏰤􏰋􏰏􏰏 􏰒􏰘􏰃􏰗􏰘 􏰊􏰗􏰂􏰙 􏰍􏰗􏰃􏰎􏰈 􏰒􏰄􏰃􏰗􏰟􏰈 􏰋􏰉 􏰚􏰉􏰤􏰄􏰋􏰍􏰈􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰒􏰢 􏰣􏰄 􏰤􏰋􏰏􏰏 􏰛􏰚􏰋􏰏􏰐 􏰂􏰉 􏰂􏰚􏰗 􏰤􏰂􏰗􏰅 􏰂􏰉 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒 􏰃􏰉􏰐 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰒 􏰘􏰂 􏰒􏰘􏰚􏰐􏰠 􏰘􏰈􏰄 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰉􏰐 􏰘􏰈􏰄 􏰜􏰚􏰄􏰚􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰝 􏰒􏰄􏰄􏰋􏰉􏰍 􏰈􏰂􏰤 􏰘􏰈􏰄 􏰐􏰄􏰒􏰋􏰍􏰉 􏰂􏰊 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒 􏰃􏰉􏰐 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰒 􏰍􏰂 􏰋􏰉 􏰏􏰂􏰟􏰅􏰒􏰘􏰄􏰎􏰢 􏰣􏰄 􏰤􏰋􏰏􏰏 􏰃􏰏􏰒􏰂 􏰃􏰎􏰎􏰏􏰠 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰘􏰂 􏰃 􏰗􏰄􏰃􏰏􏰥􏰤􏰂􏰗􏰏􏰐 􏰒􏰂􏰟􏰋􏰃􏰏 􏰉􏰄􏰘􏰤􏰂􏰗􏰅 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰢 􏰧􏰉 􏰘􏰈􏰄 􏰏􏰋􏰌􏰄 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰝 􏰤􏰄 􏰤􏰋􏰏􏰏 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰊􏰂􏰗 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒 􏰋􏰉 􏰤􏰄􏰋􏰍􏰈􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰒􏰢
􏰪􏰗􏰄􏰎􏰃􏰗􏰃􏰘􏰋􏰂􏰉 􏰫􏰄􏰃􏰐􏰋􏰉􏰍􏰒􏰕
􏰖􏰚􏰘􏰘􏰃􏰍􏰕 􏰬􏰈􏰃􏰎􏰘􏰄􏰗 􏰭􏰮􏰢􏰮􏰢 􏰯􏰫
􏰰􏰚􏰉􏰝 􏰱􏰄􏰗􏰄􏰙􏰠􏰢 􏰨􏰄􏰎􏰘􏰈􏰥 􏰃􏰉􏰐 􏰲􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰡􏰋􏰗􏰒􏰘 􏰑􏰄􏰃􏰗􏰟􏰈􏰢
􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰆􏰄􏰗􏰄􏰙􏰠􏰅􏰚􏰉􏰢􏰟􏰂􏰙􏰳􏰮􏰴􏰭􏰵􏰳􏰴􏰭􏰳􏰮􏰮􏰳􏰐􏰄􏰎􏰘􏰈􏰥􏰃􏰉􏰐􏰥􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘􏰥􏰒􏰄􏰃􏰗􏰟􏰈􏰳 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰆􏰄􏰗􏰄􏰙􏰠􏰅􏰚􏰉􏰢􏰟􏰂􏰙􏰳􏰮􏰴􏰭􏰵􏰳􏰴􏰭􏰳􏰮􏰮􏰳􏰐􏰄􏰎􏰘􏰈􏰥􏰃􏰉􏰐􏰥􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘􏰥􏰒􏰄􏰃􏰗􏰟􏰈􏰳􏰷
􏰸􏰂􏰂􏰗􏰄􏰝 􏰰􏰃􏰗􏰏􏰄􏰋􏰍􏰈􏰢 􏰲􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰶􏰲􏰡􏰑􏰷􏰢
􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰛􏰗􏰋􏰏􏰏􏰋􏰃􏰉􏰘􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘􏰥􏰒􏰄􏰃􏰗􏰟􏰈􏰥􏰛􏰊􏰒􏰳 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰛􏰗􏰋􏰏􏰏􏰋􏰃􏰉􏰘􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘􏰥􏰒􏰄􏰃􏰗􏰟􏰈􏰥􏰛􏰊􏰒􏰳􏰷
􏰣􏰋􏰅􏰋􏰎􏰄􏰐􏰋􏰃􏰢 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰹􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢
􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰄􏰉􏰢􏰤􏰋􏰅􏰋􏰎􏰄􏰐􏰋􏰃􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰺􏰮􏰔􏰒􏰻􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰄􏰉􏰢􏰤􏰋􏰅􏰋􏰎􏰄􏰐􏰋􏰃􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰺􏰮􏰔􏰒􏰻􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰷
􏰼􏰛􏰋􏰠􏰝 􏰽􏰈􏰃􏰐􏰐􏰄􏰚􏰒􏰝 􏰄􏰘 􏰃􏰏􏰢 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰹􏰒 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢
􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰛􏰗􏰋􏰏􏰏􏰋􏰃􏰉􏰘􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰐􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰒􏰥􏰒􏰈􏰂􏰗􏰘􏰥􏰎􏰃􏰘􏰈􏰥􏰦􏰉􏰐􏰄􏰗􏰳 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰛􏰗􏰋􏰏􏰏􏰋􏰃􏰉􏰘􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰐􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰒􏰥􏰒􏰈􏰂􏰗􏰘􏰥􏰎􏰃􏰘􏰈􏰥􏰦􏰉􏰐􏰄􏰗􏰳􏰷
􏰾􏰃􏰿􏰿􏰃􏰗􏰐􏰝 􏱀􏰗􏰋􏰅􏰢 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰹􏰒 􏰼􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰥 􏰑􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰪􏰃􏰘􏰈
􏰈􏰘􏰘􏰎􏰕􏰳􏰳􏰌􏰃􏰒􏰋􏰗􏰢􏰉􏰄􏰘􏰳􏰛􏰏􏰂􏰍􏰳􏰍􏰃􏰙􏰄􏰻􏰐􏰄􏰌􏰄􏰏􏰂􏰎􏰙􏰄􏰉􏰘􏰳􏰐􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰒􏰻􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰻􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘􏰻􏰎􏰃􏰘􏰈 􏰶􏰈􏰘􏰘􏰎􏰕􏰳􏰳􏰌􏰃􏰒􏰋􏰗􏰢􏰉􏰄􏰘􏰳􏰛􏰏􏰂􏰍􏰳􏰍􏰃􏰙􏰄􏰻􏰐􏰄􏰌􏰄􏰏􏰂􏰎􏰙􏰄􏰉􏰘􏰳􏰐􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰒􏰻􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰻􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘􏰻􏰎􏰃􏰘􏰈􏰷
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒􏰕
􏰪􏰏􏰄􏰃􏰒􏰄 􏰗􏰄􏰃􏰐 􏰘􏰈􏰄 􏰙􏰃􏰘􏰄􏰗􏰋􏰃􏰏 􏰃􏰛􏰂􏰌􏰄􏰝 􏰃􏰉􏰐 􏰘􏰈􏰋􏰉􏰅 􏰃􏰛􏰂􏰚􏰘 􏰈􏰂􏰤 􏰠􏰂􏰚 􏰤􏰂􏰚􏰏􏰐 􏰄􏱂􏰎􏰏􏰃􏰋􏰉 􏰘􏰂 􏰠􏰂􏰚􏰗 􏰟􏰏􏰃􏰒􏰒􏰙􏰃􏰘􏰄􏰒􏰕
􏰣􏰈􏰃􏰘 􏰃􏰗􏰄 􏰘􏰈􏰗􏰄􏰄 􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰒 􏰂􏰊 􏰄􏰌􏰄􏰗􏰠􏰐􏰃􏰠 􏰘􏰈􏰋􏰉􏰍􏰒 􏰘􏰈􏰃􏰘 􏰟􏰃􏰉 􏰛􏰄 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰄􏰐 􏰃􏰒 􏰚􏰉􏰤􏰄􏰋􏰍􏰈􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰒􏱃
􏰣􏰈􏰃􏰘 􏰃􏰗􏰄 􏰃􏰒􏰒􏰚􏰙􏰎􏰘􏰋􏰂􏰉􏰒 􏰙􏰃􏰐􏰄 􏰋􏰉 􏰘􏰈􏰄 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏱃 􏰣􏰈􏰃􏰘 􏰋􏰒 􏰘􏰈􏰄 􏰂􏰚􏰘􏰎􏰚􏰘 􏰂􏰊 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏱃 􏰣􏰈􏰃􏰘 􏰃􏰗􏰄 􏰘􏰈􏰄 􏰃􏰒􏰒􏰚􏰙􏰎􏰘􏰋􏰂􏰉􏰒 􏰙􏰃􏰐􏰄 􏰋􏰉 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰹􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰝 􏰃􏰉􏰐 􏰤􏰈􏰃􏰘 􏰋􏰒 􏰘􏰈􏰄 􏰂􏰚􏰘􏰎􏰚􏰘􏱃
􏰾􏰂􏰤 􏰐􏰂􏰄􏰒 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰤􏰂􏰗􏰅􏱃
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
2/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰑􏰚􏰛􏰙􏰋􏰒􏰒􏰋􏰂􏰉
􏰲􏰠 􏰘􏰈􏰄 􏰄􏰉􏰐 􏰂􏰊 􏰘􏰈􏰋􏰒 􏰏􏰃􏰛􏰝 􏰠􏰂􏰚 􏰒􏰈􏰂􏰚􏰏􏰐 􏰈􏰃􏰌􏰄 􏰒􏰚􏰛􏰙􏰋􏰘􏰘􏰄􏰐 􏰘􏰈􏰄 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰒 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰟􏰂􏰙􏰙􏰃􏰉􏰐 p􏰚thon ok — submit 􏰢 􏱄􏰂􏰚 􏰙􏰃􏰠 􏰒􏰚􏰛􏰙􏰋􏰘 􏰙􏰂􏰗􏰄 􏰘􏰈􏰃􏰉 􏰂􏰉􏰟􏰄 􏰛􏰄􏰊􏰂􏰗􏰄 􏰘􏰈􏰄 􏰐􏰄􏰃􏰐􏰏􏰋􏰉􏰄􏱅 􏰂􏰉􏰏􏰠 􏰘􏰈􏰄 􏰦􏰉􏰃􏰏 􏰒􏰚􏰛􏰙􏰋􏰒􏰒􏰋􏰂􏰉 􏰤􏰋􏰏􏰏 􏰛􏰄 􏰍􏰗􏰃􏰐􏰄􏰐􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒 􏰭 􏰥 􏰵 􏰃􏰉􏰐 􏱆􏰥 􏱇 􏰙􏰚􏰒􏰘 􏰛􏰄 􏰟􏰂􏰙􏰎􏰏􏰄􏰘􏰄􏰐 􏰋􏰉 􏰂􏰗􏰐􏰄􏰗 􏰘􏰂 􏰗􏰄􏰟􏰄􏰋􏰌􏰄 􏰟􏰗􏰄􏰐􏰋􏰘 􏰊􏰂􏰗 􏰘􏰈􏰄 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒 􏱈 􏰃􏰉􏰐 􏰔􏰥􏱉 􏰃􏰗􏰄 􏰂􏰎􏰘􏰋􏰂􏰉􏰃􏰏􏰢 􏰧􏰘 􏰋􏰒 􏰗􏰄􏰟􏰂􏰙􏰙􏰄􏰉􏰐􏰄􏰐 􏰘􏰈􏰃􏰘 􏰠􏰂􏰚 􏰤􏰂􏰗􏰅 􏰂􏰉 􏰘􏰈􏰄􏰒􏰄 􏰋􏰊 􏰠􏰂􏰚 􏰦􏰉􏰋􏰒􏰈 􏰘􏰈􏰄 􏰗􏰄􏰜􏰚􏰋􏰗􏰄􏰐 􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒 􏰄􏰃􏰗􏰏􏰠􏰝 􏰂􏰗 􏰂􏰉 􏰠􏰂􏰚􏰗 􏰂􏰤􏰉 􏰘􏰋􏰙􏰄 􏰃􏰒 􏰄􏱂􏰘􏰗􏰃 􏰎􏰗􏰃􏰟􏰘􏰋􏰟􏰄􏰢
􏱋􏰒􏰋􏰉􏰍 􏰯􏰰
􏰣􏰄 􏰚􏰒􏰄 􏰃 􏰎􏰗􏰂􏰍􏰗􏰃􏰙 􏰟􏰃􏰏􏰏􏰄􏰐 􏰯􏰰 􏰊􏰂􏰗 􏰃􏰚􏰘􏰂􏰍􏰗􏰃􏰐􏰋􏰉􏰍 􏰃􏰒􏰒􏰋􏰍􏰉􏰙􏰄􏰉􏰘􏰒􏰢 􏱄􏰂􏰚 􏰒􏰈􏰂􏰚􏰏􏰐 􏰈􏰃􏰌􏰄 􏰯􏰰 􏰋􏰉 􏰘􏰈􏰄 􏰒􏰘􏰃􏰗􏰘􏰄􏰗 􏰦􏰏􏰄􏰒 􏰐􏰂􏰤􏰉􏰏􏰂􏰃􏰐􏰄􏰐 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰢 􏰡􏰂􏰗 􏰙􏰂􏰗􏰄 􏰋􏰉􏰊􏰂􏰗􏰙􏰃􏰘􏰋􏰂􏰉 􏰂􏰉 􏰚􏰒􏰋􏰉􏰍 􏰯􏰰 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰒􏰝 􏰏􏰄􏰃􏰗􏰉 􏰙􏰂􏰗􏰄 􏰈􏰄􏰗􏰄􏰢 􏰽􏰂 􏰚􏰒􏰄 􏰯􏰰 􏰘􏰂 􏰘􏰄􏰒􏰘 􏰃 􏰒􏰎􏰄􏰟􏰋􏰦􏰄􏰐 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉􏰝 􏰗􏰚􏰉 􏰘􏰈􏰄 􏰊􏰂􏰏􏰏􏰂􏰤􏰋􏰉􏰍 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰕
p􏰚thon ok -q function_name
􏰲􏰠􏰐􏰄􏰊􏰃􏰚􏰏􏰘􏰝􏰂􏰉􏰏􏰠􏰘􏰄􏰒􏰘􏰒􏰘􏰈􏰃􏰘􏰐􏰋􏰐􏰉􏰂􏰘􏰎􏰃􏰒􏰒􏰤􏰋􏰏􏰏􏰒􏰈􏰂􏰤􏰚􏰎􏰢􏱄􏰂􏰚􏰟􏰃􏰉􏰚􏰒􏰄􏰘􏰈􏰄 -v 􏰂􏰎􏰘􏰋􏰂􏰉􏰘􏰂􏰒􏰈􏰂􏰤􏰃􏰏􏰏􏰘􏰄􏰒􏰘􏰒􏰝􏰋􏰉􏰟􏰏􏰚􏰐􏰋􏰉􏰍 􏰘􏰄􏰒􏰘􏰒 􏰠􏰂􏰚 􏰈􏰃􏰌􏰄 􏰎􏰃􏰒􏰒􏰄􏰐􏰕
p􏰚thon ok -q function_name -v
􏰡􏰋􏰉􏰃􏰏􏰏􏰠􏰝􏰤􏰈􏰄􏰉􏰠􏰂􏰚􏰈􏰃􏰌􏰄􏰦􏰉􏰋􏰒􏰈􏰄􏰐􏰃􏰏􏰏􏰘􏰈􏰄􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒􏰝􏰠􏰂􏰚􏰙􏰚􏰒􏰘􏰒􏰚􏰛􏰙􏰋􏰘􏰘􏰈􏰄􏰃􏰒􏰒􏰋􏰍􏰉􏰙􏰄􏰉􏰘􏰚􏰒􏰋􏰉􏰍􏰘􏰈􏰄 –submit 􏰂􏰎􏰘􏰋􏰂􏰉􏰕
p􏰚thon ok –submit
􏰫􏰄􏰟􏰃􏰎
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏰭􏰕 􏰫􏰄􏰟􏰃􏰎 􏱋􏰒􏰄 􏰘􏰈􏰄 􏰟􏰂􏰙􏰙􏰃􏰉􏰐
p􏰚thon ok -q recap -u
􏰂􏰉 􏰘􏰈􏰄 􏰟􏰂􏰙􏰙􏰃􏰉􏰐 􏰏􏰋􏰉􏰄 􏰘􏰂 􏰗􏰄􏰟􏰃􏰎 􏰒􏰂􏰙􏰄 􏰂􏰊 􏰘􏰈􏰄 􏰟􏰂􏰉􏰟􏰄􏰎􏰘􏰒 􏰤􏰄􏰩􏰌􏰄 􏰒􏰄􏰄􏰉 􏰄􏰃􏰗􏰏􏰋􏰄􏰗􏰢
􏱊􏰂􏰘􏰄􏰢 􏰧􏰊 􏰠􏰂􏰚 􏰐􏰂􏰉􏰩􏰘 􏰐􏰂 􏰘􏰈􏰄 􏰂􏰎􏰘􏰋􏰂􏰉􏰃􏰏 􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒􏰝 􏰠􏰂􏰚 􏰙􏰋􏰍􏰈􏰘 􏰄􏰉􏰟􏰂􏰚􏰉􏰘􏰄􏰗 􏰊􏰃􏰋􏰏􏰋􏰉􏰍 􏰘􏰄􏰒􏰘 􏰟􏰃􏰒􏰄􏰒 􏰤􏰈􏰄􏰉 􏰒􏰚􏰛􏰙􏰋􏰘􏰘􏰋􏰉􏰍 􏰂􏰗 􏰗􏰚􏰉􏰉􏰋􏰉􏰍 p􏰚thon ok 􏰢 􏰼􏰒 􏰏􏰂􏰉􏰍 􏰃􏰒 􏰠􏰂􏰚 􏰎􏰃􏰒􏰒 􏰘􏰈􏰄 􏰘􏰄􏰒􏰘􏰒 􏰊􏰂􏰗 􏰘􏰈􏰄 􏰗􏰄􏰜􏰚􏰋􏰗􏰄􏰐 􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒􏰝 􏰠􏰂􏰚 􏰤􏰋􏰏􏰏 􏰗􏰄􏰟􏰄􏰋􏰌􏰄 􏰟􏰗􏰄􏰐􏰋􏰘 􏰊􏰂􏰗 􏰦􏰉􏰋􏰒􏰈􏰋􏰉􏰍 􏰘􏰈􏰄 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰢
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
3/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰖􏰗􏰃􏰎􏰈􏰒 􏰃􏰉􏰐 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈
􏰫􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰋􏰉􏰍 􏰍􏰗􏰃􏰎􏰈􏰒
􏰧􏰉 􏰘􏰈􏰄 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰝 􏰤􏰄 􏰤􏰂􏰗􏰅􏰄􏰐 􏰂􏰉 􏰂􏰛􏰆􏰄􏰟􏰘􏰥􏰂􏰗􏰋􏰄􏰉􏰘􏰄􏰐 􏰎􏰗􏰂􏰍􏰗􏰃􏰙􏰙􏰋􏰉􏰍􏰢 􏰣􏰄 􏰏􏰄􏰃􏰗􏰉􏰄􏰐 􏰘􏰂 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘 􏰉􏰄􏰤 􏰘􏰠􏰎􏰄􏰒 􏰂􏰊 􏰐􏰃􏰘􏰃 􏰶􏰒􏰚􏰟􏰈 􏰃􏰒 􏰎􏰂􏰟􏰅􏰄􏰘 􏰙􏰂􏰉􏰒􏰘􏰄􏰗􏰒􏰝 􏰉􏰂􏰐􏰄􏰒􏰝 􏰃􏰉􏰐 􏰜􏰚􏰄􏰚􏰄􏰒􏰷 􏰃􏰒 􏰪􏰠􏰘􏰈􏰂􏰉 􏰟􏰏􏰃􏰒􏰒􏰄􏰒􏰢 􏰽􏰈􏰋􏰒 􏰙􏰃􏰠 􏰒􏰘􏰃􏰗􏰘 􏰘􏰂 􏰋􏰉􏰒􏰎􏰋􏰗􏰄 􏰚􏰒 􏰘􏰂 􏰘􏰈􏰋􏰉􏰅 􏰂􏰊 􏰃􏰉􏰠 􏰎􏰗􏰂􏰛􏰏􏰄􏰙 􏰋􏰉 􏰘􏰄􏰗􏰙􏰒 􏰂􏰊 􏰄􏰏􏰄􏰙􏰄􏰉􏰘􏰒 􏰘􏰈􏰃􏰘 􏰙􏰋􏰍􏰈􏰘 􏰛􏰄 􏰛􏰄􏰒􏰘 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰄􏰐 􏰃􏰒 􏰟􏰏􏰃􏰒􏰒􏰄􏰒􏰢
􏰧􏰉 􏰘􏰈􏰄 􏰟􏰃􏰒􏰄 􏰂􏰊 􏰍􏰗􏰃􏰎􏰈􏰒􏰝 􏰤􏰄 􏰙􏰋􏰍􏰈􏰘 􏰘􏰈􏰋􏰉􏰅 􏰂􏰊 􏰍􏰗􏰃􏰎􏰈 node􏰒 􏰃􏰉􏰐 edge􏰒 􏰃􏰒 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰂􏰛􏰆􏰄􏰟􏰘􏰒 􏰊􏰂􏰗 􏰤􏰈􏰋􏰟􏰈 􏰤􏰄 􏰟􏰂􏰚􏰏􏰐 􏰤􏰗􏰋􏰘􏰄 􏰟􏰏􏰃􏰒􏰒􏰄􏰒􏰢 􏰼 􏰉􏰂􏰐􏰄 􏰤􏰂􏰚􏰏􏰐 􏰈􏰃􏰌􏰄 􏰃􏰘 􏰏􏰄􏰃􏰒􏰘 􏰃 􏰉􏰃􏰙􏰄􏰝 􏰤􏰈􏰋􏰏􏰄 􏰃􏰉 􏰄􏰐􏰍􏰄 􏰙􏰋􏰍􏰈􏰘 􏰒􏰘􏰂􏰗􏰄 􏰟􏰂􏰉􏰉􏰄􏰟􏰘􏰋􏰂􏰉􏰒 􏰘􏰂 􏰘􏰤􏰂 􏰉􏰂􏰐􏰄􏰒􏰢
􏰽􏰈􏰋􏰒 􏰋􏰒 􏰃 􏰌􏰄􏰗􏰠 􏰚􏰒􏰄􏰊􏰚􏰏 􏰤􏰃􏰠 􏰂􏰊 􏰘􏰈􏰋􏰉􏰅􏰋􏰉􏰍 􏰋􏰉 􏰃􏰛􏰒􏰘􏰗􏰃􏰟􏰘􏰋􏰂􏰉􏰒􏰝 􏰄􏰒􏰎􏰄􏰟􏰋􏰃􏰏􏰏􏰠 􏰋􏰊 􏰂􏰚􏰗 􏰂􏰛􏰆􏰄􏰟􏰘􏰒 􏰒􏰘􏰃􏰗􏰘 􏰘􏰂 􏰛􏰄􏰟􏰂􏰙􏰄 􏰙􏰂􏰗􏰄 􏰟􏰂􏰙􏰎􏰏􏰋􏰟􏰃􏰘􏰄􏰐􏰝 􏰤􏰋􏰘􏰈 􏰒􏰄􏰌􏰄􏰗􏰃􏰏 􏰃􏰘􏰘􏰗􏰋􏰛􏰚􏰘􏰄􏰒 􏰃􏰉􏰐 􏰗􏰄􏰏􏰃􏰘􏰄􏰐 􏰃􏰟􏰘􏰋􏰂􏰉􏰒􏰝 􏰏􏰋􏰅􏰄 􏰂􏰚􏰗 􏰎􏰂􏰟􏰅􏰄􏰘 􏰙􏰂􏰉􏰒􏰘􏰄􏰗􏰒􏰢 􏰽􏰈􏰄 􏰖􏰚􏰘􏰘􏰃􏰍 􏰛􏰂􏰂􏰅 􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰒 􏰍􏰗􏰃􏰎􏰈 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰒 􏰛􏰠 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰄􏰐􏰍􏰄􏰒 􏰃􏰒 􏰟􏰏􏰃􏰒􏰒􏰄􏰒􏰝 􏰃􏰉􏰐 􏰍􏰗􏰃􏰎􏰈􏰒 􏰃􏰒 􏰃􏰉􏰂􏰘􏰈􏰄􏰗 􏰟􏰏􏰃􏰒􏰒 􏰘􏰈􏰃􏰘 􏰟􏰂􏰉􏰒􏰋􏰒􏰘􏰒 􏰂􏰊 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰄􏰐􏰍􏰄􏰒􏰝
􏰽􏰈􏰋􏰒 􏰋􏰒 􏰃 􏰍􏰗􏰄􏰃􏰘 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄 􏰊􏰂􏰗 􏰚􏰉􏰐􏰄􏰗􏰒􏰘􏰃􏰉􏰐􏰋􏰉􏰍 􏰯􏰯􏰪􏰝 􏰛􏰚􏰘 􏰊􏰂􏰗 􏰂􏰚􏰗 􏰒􏰎􏰄􏰟􏰋􏰦􏰟 􏰃􏰉􏰐 􏰎􏰚􏰗􏰎􏰂􏰒􏰄􏰒 􏰥 􏰦􏰉􏰐􏰋􏰉􏰍 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒 􏰚􏰒􏰋􏰉􏰍 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰥 􏰤􏰄􏰩􏰏􏰏 􏰒􏰋􏰙􏰎􏰏􏰋􏰊􏰠 􏰋􏰘 􏰃 􏰏􏰋􏰘􏰘􏰏􏰄􏰢 􏰯􏰚􏰗 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰄􏰐􏰍􏰄􏰒 􏰤􏰂􏰉􏰩􏰘 􏰈􏰃􏰌􏰄 􏰘􏰂􏰂 􏰙􏰃􏰉􏰠 􏰃􏰘􏰘􏰗􏰋􏰛􏰚􏰘􏰄􏰒􏰝 􏰒􏰂 􏰤􏰄 􏰤􏰂􏰉􏰩􏰘 􏰤􏰗􏰋􏰘􏰄 􏰒􏰄􏰎􏰃􏰗􏰃􏰘􏰄 􏰟􏰏􏰃􏰒􏰒􏰄􏰒 􏰘􏰂 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘 􏰘􏰈􏰄􏰙􏰢 􏱍􏰋􏰅􏰄 􏰘􏰈􏰄 􏰛􏰂􏰂􏰅􏰝 􏰤􏰄􏰩􏰏􏰏 􏰚􏰒􏰄 􏰃 􏰖􏰗􏰃􏰎􏰈 􏰟􏰏􏰃􏰒􏰒􏰝 􏰛􏰚􏰘 􏰋􏰉􏰒􏰋􏰐􏰄 􏰋􏰘 􏰤􏰄􏰩􏰏􏰏 􏰈􏰃􏰌􏰄 􏰃 􏰒􏰏􏰋􏰍􏰈􏰘􏰏􏰠 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰍􏰗􏰃􏰎􏰈 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰤􏰋􏰘􏰈􏰂􏰚􏰘 􏰚􏰒􏰋􏰉􏰍 􏰒􏰄􏰎􏰃􏰗􏰃􏰘􏰄 􏰟􏰏􏰃􏰒􏰒􏰄􏰒 􏰊􏰂􏰗 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰄􏰐􏰍􏰄􏰒􏰢
􏰣􏰄􏰩􏰏􏰏 􏰊􏰂􏰏􏰏􏰂􏰤 􏰘􏰈􏰄 adjacenc􏰠 li􏰒􏰘 􏰍􏰗􏰃􏰎􏰈 􏰒􏰎􏰄􏰟􏰋􏰦􏰟􏰃􏰘􏰋􏰂􏰉 􏰠􏰂􏰚 􏰏􏰄􏰃􏰗􏰉􏰄􏰐 􏰋􏰉 􏰘􏰈􏰄 􏰏􏰄􏰟􏰘􏰚􏰗􏰄􏰢 􏰸􏰂􏰗􏰄 􏰒􏰎􏰄􏰟􏰋􏰦􏰟􏰃􏰏􏰏􏰠􏰝 􏰤􏰄􏰩􏰏􏰏 􏰒􏰘􏰂􏰗􏰄 􏰘􏰈􏰄 􏰄􏰐􏰍􏰄􏰒 􏰂􏰊 􏰃 􏰍􏰗􏰃􏰎􏰈 􏰋􏰉 􏰃 dic􏰘iona􏰗􏰠 􏰒􏰚􏰟􏰈 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰅􏰄􏰠􏰒 􏰂􏰊 􏰘􏰈􏰄 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰃􏰗􏰄 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒􏰝 􏰃􏰉􏰐 􏰘􏰈􏰄 􏰌􏰃􏰏􏰚􏰄􏰒 􏰃􏰗􏰄 􏰃 􏰒e􏰘 􏰂􏰊 􏰉􏰂􏰐􏰄􏰒 􏰋􏰘 􏰈􏰃􏰒 􏰐􏰋􏰗􏰄􏰟􏰘 􏰄􏰐􏰍􏰄􏰒 􏰘􏰂 􏰶􏰘􏰈􏰄􏰒􏰄 􏰃􏰗􏰄 􏰟􏰃􏰏􏰏􏰄􏰐 􏰋􏰘􏰒 child 􏰉􏰂􏰐􏰄􏰒􏰷􏰢 􏰽􏰈􏰋􏰒 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰘􏰈􏰄􏰉 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰒 􏰃􏰏􏰏 􏰘􏰈􏰄 􏰄􏰐􏰍􏰄􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈􏰢
􏰡􏰂􏰗 􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰝 􏰘􏰈􏰄 􏰊􏰂􏰏􏰏􏰂􏰤􏰋􏰉􏰍 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰐􏰄􏰦􏰉􏰄􏰒 􏰘􏰈􏰄 􏰃􏰐􏰆􏰃􏰟􏰄􏰉􏰟􏰠 􏰏􏰋􏰒􏰘 􏰂􏰊 􏰃 􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈 􏰤􏰋􏰘􏰈 􏰊􏰂􏰚􏰗 􏰉􏰂􏰐􏰄􏰒􏰢
􏰣􏰄 􏰤􏰋􏰏􏰏 􏰚􏰒􏰄 􏰃 􏰟􏰏􏰃􏰒􏰒􏰝 Digraph 􏰝 􏰒􏰋􏰙􏰋􏰏􏰃􏰗 􏰘􏰂 􏰘􏰈􏰄 􏰂􏰉􏰄 􏰋􏰉 􏰠􏰂􏰚􏰗 􏰘􏰄􏱂􏰘􏰛􏰂􏰂􏰅􏰝 􏰘􏰂 􏰟􏰂􏰙􏰛􏰋􏰉􏰄 􏰘􏰈􏰄 􏰃􏰐􏰆􏰃􏰟􏰄􏰉􏰟􏰠 􏰏􏰋􏰒􏰘 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰤􏰋􏰘􏰈 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉􏰃􏰏􏰋􏰘􏰠 􏰤􏰄 􏰚􏰒􏰄 􏰤􏰋􏰘􏰈 􏰍􏰗􏰃􏰎􏰈􏰒􏰢
adj_list = 􏰤’a’:􏰤’b’􏰠, ‘b’:􏰤’c’, ‘d’􏰠, ‘c’:􏰤’d’􏰠, ‘d’:set()􏰠 # ‘d’ has no nodes
s􏰎ar􏰎ing from i􏰎, so emp􏰎􏰚 se􏰎.
cla􏰂􏰂 Dig􏰉a􏰏h(object):
“””
Direc􏰎ed graph.
edges is a dic􏰎ionar􏰚 mapping each node 􏰎o a se􏰎 of i􏰎s children nodes.
n􏰜m_edges is 􏰎he 􏰎o􏰎al n􏰜mber of edges.
“””
def __init__(self):
self.edges = dict()
self.num_edges = 0
# more code
􏱋􏰉􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰒
􏰽􏰂 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰃􏰉 􏰚􏰉􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰝 􏰤􏰄 􏰟􏰃􏰉 􏰚􏰒􏰄 􏰙􏰚􏰟􏰈 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰋􏰐􏰄􏰃􏰒 􏰃􏰒 􏰃 􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰢 􏰧􏰉 􏰊􏰃􏰟􏰘􏰝 􏰤􏰄􏰩􏰏􏰏 􏰒􏰋􏰙􏰎􏰏􏰠 􏰤􏰗􏰋􏰘􏰄 Graph 􏰃􏰒 􏰃 􏰒􏰚􏰛􏰟􏰏􏰃􏰒􏰒 􏰂􏰊 Digraph 􏰝 􏰛􏰚􏰘 􏰤􏰋􏰘􏰈 􏰄􏰐􏰍􏰄􏰒 􏰋􏰉 􏰘􏰤􏰂 􏰐􏰋􏰗􏰄􏰟􏰘􏰋􏰂􏰉􏰒􏰢
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
4/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
cla􏰂􏰂 G􏰉a􏰏h(Digraph):
“””
Undirec􏰎ed graph: 􏰎􏰒o one-􏰒a􏰚 edges for e􏰗er􏰚 edge
“””
def add_edge(self, src, dest):
Digraph.add_edge(self, src, dest)
Digraph.add_edge(self, dest, src)
􏰽􏰈􏰋􏰒􏰋􏰒􏰃􏰉􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰂􏰊inhe􏰗i􏰘ance􏰛􏰄􏰘􏰤􏰄􏰄􏰉􏰪􏰠􏰘􏰈􏰂􏰉􏰂􏰛􏰆􏰄􏰟􏰘􏰒􏰢􏰬􏰗􏰄􏰃􏰘􏰋􏰉􏰍􏰃 Graph(Digraph) 􏰘􏰄􏰏􏰏􏰒􏰪􏰠􏰘􏰈􏰂􏰉􏰘􏰈􏰃􏰘 􏰃 Graph 􏰂􏰛􏰆􏰄􏰟􏰘􏰈􏰃􏰒􏰃􏰏􏰏􏰘􏰈􏰄􏰙􏰄􏰘􏰈􏰂􏰐􏰒􏰂􏰊􏰃 Digraph 􏰂􏰛􏰆􏰄􏰟􏰘􏰥􏰥􏰥􏰂􏰉􏰏􏰠􏰘􏰈􏰄􏰤􏰃􏰠􏰤􏰄􏰃􏰐􏰐􏰄􏰐􏰍􏰄􏰒􏰋􏰒􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘􏰢􏰽􏰈􏰋􏰒 􏰙􏰄􏰘􏰈􏰂􏰐 􏰋􏰒 􏱎􏰂􏰌􏰄􏰗􏰤􏰗􏰋􏰘􏰘􏰄􏰉􏱎 􏰛􏰠 􏰘􏰈􏰄 􏰉􏰄􏰤 􏰟􏰏􏰃􏰒􏰒􏰢 􏰽􏰈􏰄 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰟􏰄 􏰋􏰒 􏰘􏰈􏰃􏰘 􏰉􏰂􏰤 􏰤􏰄􏰩􏰗􏰄 􏰃􏰐􏰐􏰋􏰉􏰍 􏰃 􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰄􏰐􏰍􏰄 􏰋􏰉 􏰛􏰂􏰘􏰈 􏰤􏰃􏰠􏰒 􏰘􏰂 􏰟􏰗􏰄􏰃􏰘􏰄 􏰃􏰉 􏰚􏰉􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰢 􏰽􏰈􏰋􏰒 􏰋􏰒 􏰃􏰉 􏰋􏰉􏰄􏰞􏰟􏰋􏰄􏰉􏰘 􏰤􏰃􏰠 􏰂􏰊 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰃􏰉 􏰚􏰉􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰝 􏰛􏰚􏰘 􏰃 􏰒􏰋􏰙􏰎􏰏􏰄 􏰂􏰉􏰄􏰢
􏰧􏰙􏰎􏰂􏰗􏰘􏰋􏰉􏰍 􏰙􏰂􏰐􏰚􏰏􏰄􏰒
􏰧􏰉 􏰘􏰈􏰋􏰒 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰝 􏰘􏰈􏰄 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰒 􏰃􏰗􏰄 􏰋􏰉 ses07.p􏰚 􏰝 􏰛􏰚􏰘 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰋􏰒 􏰋􏰉 􏰃 􏰒􏰄􏰎􏰃􏰗􏰃􏰘􏰄 􏰪􏰠􏰘􏰈􏰂􏰉 􏰦􏰏􏰄 ses07_data_structures.p􏰚 􏰢 􏰽􏰈􏰋􏰒 􏰋􏰒 􏰚􏰒􏰄􏰊􏰚􏰏 􏰃􏰒 􏰤􏰄 􏰐􏰂􏰉􏰩􏰘 􏰉􏰄􏰄􏰐 􏰘􏰂 􏰄􏰐􏰋􏰘 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰒􏰝 􏰃􏰉􏰐 􏰎􏰚􏰘􏰘􏰋􏰉􏰍 􏰘􏰈􏰄􏰙 􏰋􏰉 􏰂􏰚􏰗 􏰙􏰃􏰋􏰉 􏰦􏰏􏰄 􏰤􏰂􏰚􏰏􏰐 􏰙􏰃􏰅􏰄 􏰋􏰘 􏰜􏰚􏰋􏰘􏰄 􏰏􏰂􏰉􏰍􏰢 􏰡􏰚􏰗􏰘􏰈􏰄􏰗􏰙􏰂􏰗􏰄􏰝 􏰋􏰊 􏰤􏰄 􏰎􏰃􏰟􏰅􏰃􏰍􏰄 􏰂􏰚􏰗 􏰟􏰂􏰐􏰄 􏰋􏰉􏰘􏰂 􏰙􏰂􏰐􏰚􏰏􏰄􏰒􏰝 􏰤􏰄 􏰟􏰃􏰉
􏰚􏰒􏰄 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰟􏰂􏰐􏰄 􏰊􏰂􏰗 􏰒􏰂􏰏􏰌􏰋􏰉􏰍 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰒 􏰋􏰉 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰒􏰟􏰗􏰋􏰎􏰘􏰒􏰢
􏰾􏰂􏰤 􏰐􏰂 􏰤􏰄 􏰙􏰃􏰅􏰄 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰒 􏰃􏰌􏰃􏰋􏰏􏰃􏰛􏰏􏰄 􏰘􏰂 􏰚􏰒 􏰋􏰉 ses07.p􏰚 􏱃 􏰣􏰄 􏰟􏰃􏰉 􏰚􏰒􏰄 􏰘􏰈􏰄 􏰟􏰂􏰙􏰙􏰃􏰉􏰐
􏰽􏰈􏰋􏰒􏰘􏰄􏰏􏰏􏰒􏰪􏰠􏰘􏰈􏰂􏰉􏰘􏰂􏰏􏰂􏰂􏰅􏰊􏰂􏰗􏰃􏰙􏰂􏰐􏰚􏰏􏰄􏰟􏰃􏰏􏰏􏰄􏰐 ses07_data_structures 􏰃􏰉􏰐􏰋􏰙􏰎􏰂􏰗􏰘􏰘􏰈􏰄􏰐􏰄􏰦􏰉􏰋􏰘􏰋􏰂􏰉􏰒 Graph, Digraph, Queue, QueueNode 􏰢 􏰽􏰈􏰄􏰒􏰄 􏰐􏰄􏰦􏰉􏰋􏰘􏰋􏰂􏰉􏰒 􏰟􏰂􏰚􏰏􏰐 􏰛􏰄 􏰃􏰉􏰠 􏰉􏰃􏰙􏰄􏰒 􏰤􏰄 􏰐􏰄􏰦􏰉􏰄 􏰋􏰉 􏰘􏰈􏰄
􏰙􏰂􏰐􏰚􏰏􏰄􏰕 􏰟􏰏􏰃􏰒􏰒􏰄􏰒􏰝 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉􏰒􏰝 􏰂􏰗 􏰌􏰃􏰗􏰋􏰃􏰛􏰏􏰄􏰒􏰢 􏰯􏰉􏰟􏰄 􏰤􏰄 􏰗􏰚􏰉 􏰘􏰈􏰋􏰒 􏰏􏰋􏰉􏰄 􏰂􏰊 􏰟􏰂􏰐􏰄􏰝 􏰤􏰄 􏰟􏰃􏰉 􏰚􏰒􏰄 􏰘􏰈􏰄􏰙 􏰋􏰉 ses07.p􏰚 􏰝 􏰊􏰂􏰗 􏰄􏱂􏰃􏰙􏰎􏰏􏰄 􏰤􏰋􏰘􏰈 g = Graph() 􏰢
􏰼􏰏􏰘􏰄􏰗􏰉􏰃􏰘􏰋􏰌􏰄􏰏􏰠􏰝 􏰤􏰄 􏰟􏰂􏰚􏰏􏰐 􏰚􏰒􏰄
f􏰉􏰅􏰋 􏰂e􏰂07_da􏰎a_􏰂􏰎􏰉􏰜c􏰎􏰜􏰉e􏰂 i􏰋􏰏􏰅􏰉􏰎 Graph, Digraph, Queue, QueueNode
i􏰋􏰏􏰅􏰉􏰎 􏰂e􏰂07_da􏰎a_􏰂􏰎􏰉􏰜c􏰎􏰜􏰉e􏰂 a􏰂 d􏰂
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
5/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰽􏰈􏰋􏰒 􏰤􏰂􏰚􏰏􏰐 􏰍􏰋􏰌􏰄 􏰚􏰒 􏰃􏰟􏰟􏰄􏰒􏰒 􏰘􏰂 􏰄􏰌􏰄􏰗􏰠􏰘􏰈􏰋􏰉􏰍 􏰋􏰉 􏰘􏰈􏰄 􏰦􏰏􏰄􏰝 􏰛􏰚􏰘 􏰍􏰋􏰌􏰋􏰉􏰍 􏰋􏰘 􏰘􏰈􏰄 􏰉􏰃􏰙􏰄 ds 􏰢 􏰽􏰈􏰄􏰉 􏰤􏰄 􏰤􏰂􏰚􏰏􏰐 􏰃􏰟􏰟􏰄􏰒􏰒 􏰘􏰈􏰄􏰙 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰘􏰈􏰋􏰒 􏰉􏰃􏰙􏰄 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰐􏰂􏰘 􏰉􏰂􏰘􏰃􏰘􏰋􏰂􏰉􏰕 g = ds.Graph() 􏰢
􏱊􏰂􏰤 􏰂􏰎􏰄􏰉 􏰘􏰈􏰄 􏰦􏰏􏰄􏰒 ses07.p􏰚 􏰃􏰉􏰐 ses07_data_structures.p􏰚 􏰢
􏰲􏰄􏰊􏰂􏰗􏰄 􏰠􏰂􏰚 􏰗􏰚􏰉 􏰘􏰈􏰄 􏰋􏰙􏰎􏰂􏰗􏰘 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰝 􏰟􏰈􏰃􏰉􏰍􏰄 􏰑􏰎􏰠􏰐􏰄􏰗􏰩􏰒 􏰤􏰂􏰗􏰅􏰋􏰉􏰍 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠 􏰘􏰂 􏰘􏰈􏰄 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠 􏰤􏰈􏰄􏰗􏰄 􏰠􏰂􏰚 􏰐􏰂􏰤􏰉􏰏􏰂􏰃􏰐􏰄􏰐 􏰘􏰈􏰄 􏰦􏰏􏰄􏰒􏰢 􏰽􏰈􏰄 􏰋􏰙􏰎􏰂􏰗􏰘 􏰟􏰂􏰙􏰙􏰃􏰉􏰐 􏰤􏰂􏰗􏰅􏰒 􏰛􏰠 􏰐􏰄􏰊􏰃􏰚􏰏􏰘 􏰋􏰉 􏰘􏰈􏰄 􏰟􏰚􏰗􏰗􏰄􏰉􏰘 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏰮􏰕 􏰬􏰗􏰄􏰃􏰘􏰋􏰉􏰍 􏰃 􏰍􏰗􏰃􏰎􏰈
􏱀􏱂􏰃􏰙􏰋􏰉􏰄􏰘􏰈􏰄􏰟􏰏􏰃􏰒􏰒􏰄􏰒 Digraph 􏰃􏰉􏰐 Graph 􏰃􏰉􏰐􏰘􏰈􏰄􏰋􏰗􏰙􏰄􏰘􏰈􏰂􏰐􏰒􏰢􏱋􏰒􏰋􏰉􏰍􏰘􏰈􏰄􏰙􏰄􏰘􏰈􏰂􏰐􏰒􏰝􏰗􏰄􏰟􏰗􏰄􏰃􏰘􏰄􏰘􏰈􏰄􏰍􏰗􏰃􏰎􏰈􏰤􏰄 􏰚􏰒􏰄􏰐􏰃􏰒􏰃􏰉􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰋􏰉􏰘􏰈􏰄􏰏􏰄􏰟􏰘􏰚􏰗􏰄􏰢􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄􏰘􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 create_bfs_graph 􏰋􏰉 ses07.p􏰚􏰢
􏰽􏰄􏰒􏰘 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰤􏰋􏰘􏰈
p􏰚thon ok -q create_bfs_graph
􏱀􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰢 􏰶􏰽􏰈􏰄􏰗􏰄 􏰃􏰗􏰄 􏰉􏰂 􏰘􏰄􏰒􏰘􏰒 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰢􏰷 􏰽􏰗􏰠 􏰂􏰚􏰘 􏰘􏰈􏰄 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰍􏰗􏰃􏰎􏰈 􏰙􏰄􏰘􏰈􏰂􏰐􏰒 􏰂􏰉 􏰠􏰂􏰚􏰗 􏰟􏰗􏰄􏰃􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈 􏰋􏰉 􏰑􏰎􏰠􏰐􏰄􏰗􏰩􏰒 􏰟􏰂􏰉􏰒􏰂􏰏􏰄􏰕
􏰼􏰐􏰌􏰃􏰉􏰟􏰄􏰐􏰢 􏰧􏰊 􏰤􏰄 􏰤􏰃􏰉􏰘 􏰘􏰂 􏰏􏰂􏰃􏰐 􏰃 􏰙􏰂􏰐􏰚􏰏􏰄 􏰤􏰄􏰩􏰌􏰄 􏰒􏰃􏰌􏰄􏰐 􏰋􏰉􏰘􏰂 􏰃􏰉􏰂􏰘􏰈􏰄􏰗 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠􏰝 􏰤􏰄􏰩􏰏􏰏 􏰉􏰄􏰄􏰐 􏰘􏰂 􏰐􏰂 􏰒􏰂􏰙􏰄 􏰙􏰂􏰗􏰄 􏰒􏰘􏰄􏰎􏰒 􏰘􏰂 􏰙􏰃􏰅􏰄 􏰒􏰚􏰗􏰄 􏰪􏰠􏰘􏰈􏰂􏰉 􏰅􏰉􏰂􏰤􏰒 􏰤􏰈􏰄􏰗􏰄 􏰘􏰂 􏰦􏰉􏰐 􏰂􏰚􏰗 􏰙􏰂􏰐􏰚􏰏􏰄􏰢 􏰧􏰘 􏰋􏰉􏰌􏰂􏰏􏰌􏰄􏰒 􏰃􏰐􏰐􏰋􏰉􏰍 􏰂􏰚􏰗􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠􏰘􏰂􏰪􏰠􏰘􏰈􏰂􏰉􏰩􏰒􏱎􏰒􏰠􏰒􏰘􏰄􏰙􏰎􏰃􏰘􏰈􏱎􏰚􏰒􏰋􏰉􏰍􏰘􏰈􏰄 s􏰚s 􏰙􏰂􏰐􏰚􏰏􏰄􏰢􏰧􏰘􏰩􏰒􏰃􏰛􏰋􏰘􏰘􏰄􏰟􏰈􏰉􏰋􏰟􏰃􏰏􏰒􏰂􏰤􏰄 􏰤􏰂􏰉􏰩􏰘 􏰍􏰂 􏰋􏰉􏰘􏰂 􏰐􏰄􏰘􏰃􏰋􏰏 􏰈􏰄􏰗􏰄􏰢 􏰧􏰊 􏰠􏰂􏰚 􏰄􏰉􏰐 􏰚􏰎 􏰋􏰉 􏰃 􏰒􏰋􏰘􏰚􏰃􏰘􏰋􏰂􏰉 􏰤􏰈􏰄􏰗􏰄 􏰠􏰂􏰚 􏰉􏰄􏰄􏰐 􏰘􏰂 􏰐􏰂 􏰘􏰈􏰋􏰒􏰝 􏰒􏰄􏰃􏰗􏰟􏰈 􏰊􏰂􏰗 􏱎􏰎􏰠􏰘􏰈􏰂􏰉 􏰋􏰙􏰎􏰂􏰗􏰘 􏰊􏰗􏰂􏰙 􏰃􏰉􏰂􏰘􏰈􏰄􏰗 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠􏱎􏰢
􏱊􏰂􏰘􏰄􏰢􏰨􏰚􏰄􏰘􏰂􏰘􏰈􏰄􏰤􏰃􏰠􏰘􏰈􏰄􏰟􏰏􏰃􏰒􏰒 Graph 􏰈􏰃􏰒􏰛􏰄􏰄􏰉􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰄􏰐􏰝􏰤􏰈􏰄􏰉􏰤􏰄􏰃􏰐􏰐􏰃􏰉􏰚􏰉􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰄􏰐􏰍􏰄 􏰊􏰗􏰂􏰙 􏰱􏰂􏰈􏰉 􏰘􏰂 􏰾􏰄􏰏􏰄􏰉􏰃􏰝 􏰋􏰘 􏰤􏰂􏰗􏰅􏰒 􏰃􏰒 􏰃􏰉 􏰄􏰐􏰍􏰄 􏰛􏰂􏰘􏰈 􏰤􏰃􏰠􏰒􏰢 􏰣􏰄 􏰐􏰂􏰉􏰩􏰘 􏰉􏰄􏰄􏰐 􏰘􏰂 􏰗􏰄􏰎􏰄􏰃􏰘
add_edge 􏰊􏰗􏰂􏰙􏰾􏰄􏰏􏰄􏰉􏰃􏰘􏰂􏰱􏰂􏰈􏰉􏰢
g = create_lecture_graph()
g.children_of(‘Helena’)
g.has_node(‘Donald’)
g.has_edge(‘Donald’, ‘Helena’)
print(g) # 􏰎his 􏰒ill call 􏰎he __s􏰎r__ me􏰎hod
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
6/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰲􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈
􏱊􏰂􏰤 􏰤􏰄􏰩􏰗􏰄 􏰗􏰄􏰃􏰐􏰠 􏰘􏰂 􏰒􏰘􏰃􏰗􏰘 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰒􏰄􏰃􏰗􏰟􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒􏰢 􏰣􏰄􏰩􏰌􏰄 􏰒􏰄􏰄􏰉 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰶􏰲􏰡􏰑􏰷 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰏􏰏􏰂􏰤􏰒 􏰚􏰒 􏰘􏰂 􏰦􏰉􏰐 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰛􏰄􏰘􏰤􏰄􏰄􏰉 􏰘􏰤􏰂 􏰉􏰂􏰐􏰄􏰒 􏰋􏰉 􏰃 􏰶􏰚􏰉􏰤􏰄􏰋􏰍􏰈􏰘􏰄􏰐􏰷 􏰍􏰗􏰃􏰎􏰈􏰢 􏰣􏰄􏰩􏰏􏰏 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰲􏰡􏰑􏰝 􏰃􏰉􏰐 􏰃􏰎􏰎􏰏􏰠 􏰋􏰘 􏰘􏰂 􏰃 􏰏􏰃􏰗􏰍􏰄 􏰗􏰄􏰃􏰏􏰥􏰤􏰂􏰗􏰏􏰐 􏰐􏰃􏰘􏰃􏰒􏰄􏰘 􏰋􏰉 􏰘􏰈􏰄 􏰉􏰄􏱂􏰘 􏰒􏰄􏰟􏰘􏰋􏰂􏰉􏰢 􏰽􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰗􏰄􏰟􏰋􏰎􏰄 􏰋􏰒 􏰐􏰄􏰒􏰟􏰗􏰋􏰛􏰄􏰐 􏰛􏰄􏰏􏰂􏰤􏰢
􏰼􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰕 􏰲􏰡􏰑􏰶􏰍􏰗􏰃􏰎􏰈 􏰝 􏰒􏰘􏰃􏰗􏰘 􏰌􏰄􏰗􏰘􏰄􏱂 􏰷
􏰧􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄􏰕 􏰙􏰃􏰗􏰅 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒 􏰚􏰉􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰄􏱂􏰟􏰄􏰎􏰘 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏱋􏰒􏰄 􏱏 􏰜􏰚􏰄􏰚􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰝 􏰃􏰐􏰐 􏰘􏰂
􏰸􏰃􏰋􏰉 􏰏􏰂􏰂􏰎􏰕 􏰣􏰈􏰋􏰏􏰄 􏰜􏰚􏰄􏰚􏰄 􏰋􏰒 􏰉􏰂􏰘 􏰄􏰙􏰎􏰘􏰠􏰕
􏰫􏰄􏰙􏰂􏰌􏰄 􏰘􏰈􏰄 􏰦􏰗􏰒􏰘 􏰉􏰂􏰐􏰄 􏰂􏰊 􏰃􏰉􏰐 􏰟􏰃􏰏􏰏 􏰋􏰘 􏰡􏰂􏰗 􏰄􏰃􏰟􏰈 􏰄􏰐􏰍􏰄 􏰕 􏰋􏰊 􏰚􏰉􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐􏰕
􏰸􏰃􏰗􏰅 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰼􏰐􏰐 􏰘􏰂
􏰽􏰈􏰄 􏰄􏱂􏰘􏰗􏰃 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄 􏰋􏰉 􏰑􏰄􏰒􏰒􏰋􏰂􏰉 􏱇 􏰃􏰒􏰅􏰄􏰐 􏰚􏰒 􏰘􏰂 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰄􏰐 􏰃 􏰜􏰚􏰄􏰚􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰢 􏰽􏰈􏰋􏰒 􏰉􏰂􏰤 􏰎􏰗􏰂􏰌􏰄􏰒 􏰌􏰄􏰗􏰠 􏰚􏰒􏰄􏰊􏰚􏰏 􏰃􏰒 􏰤􏰄 􏰚􏰒􏰄 􏰃 􏰜􏰚􏰄􏰚􏰄 􏰘􏰂 􏰒􏰘􏰂􏰗􏰄 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒 􏰤􏰄 􏰟􏰃􏰉 􏰐􏰋􏰗􏰄􏰟􏰘􏰏􏰠 􏰗􏰄􏰃􏰟􏰈 􏰊􏰗􏰂􏰙 􏰃􏰏􏰗􏰄􏰃􏰐􏰠 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰉􏰂􏰐􏰄􏰒􏰢 􏰡􏰂􏰗 􏰠􏰂􏰚􏰗 􏰟􏰂􏰉􏰌􏰄􏰉􏰋􏰄􏰉􏰟􏰄􏰝􏰃 Queue 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰋􏰒􏰎􏰗􏰂􏰌􏰋􏰐􏰄􏰐􏰋􏰉􏰘􏰈􏰄􏰪􏰠􏰘􏰈􏰂􏰉􏰦􏰏􏰄􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏰵
􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄 􏰘􏰈􏰄 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰋􏰉 􏰘􏰈􏰄 􏰪􏰠􏰘􏰈􏰂􏰉 􏰟􏰂􏰐􏰄 􏰦􏰏􏰄􏰢 􏰽􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰒􏰘􏰄􏰎􏰒 􏰃􏰗􏰄 􏰄􏱂􏰃􏰟􏰘􏰏􏰠 􏰘􏰈􏰂􏰒􏰄 􏰋􏰉 􏰘􏰈􏰄 􏰗􏰄􏰟􏰋􏰎􏰄 􏰃􏰛􏰂􏰌􏰄􏰢 􏰣􏰄 􏰒􏰘􏰃􏰗􏰘 􏰤􏰋􏰘􏰈 􏰃 􏰍􏰗􏰃􏰎􏰈 􏰃􏰉􏰐 􏰃 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰉􏰂􏰐􏰄􏰝 􏰃􏰉􏰐 􏰅􏰄􏰄􏰎 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 􏰃 􏰃 dic􏰘iona􏰗􏰠 􏰂􏰊 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰃 􏰜􏰚e􏰚e 􏰂􏰊 􏰚􏰉􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰉􏰂􏰐􏰄􏰒 􏰘􏰈􏰃􏰘 􏰃􏰗􏰄 􏰃􏰐􏰆􏰃􏰟􏰄􏰉􏰘 􏰘􏰂 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰉􏰂􏰐􏰄􏰒􏰢
􏱄􏰂􏰚􏰩􏰏􏰏􏰉􏰄􏰄􏰐􏰘􏰈􏰄􏰊􏰂􏰏􏰏􏰂􏰤􏰋􏰉􏰍 Queue 􏰙􏰄􏰘􏰈􏰂􏰐􏰒􏰕
q = Queue() 􏰥 􏰋􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄 􏰄􏰙􏰎􏰘􏰠 􏰜􏰚􏰄􏰚􏰄
q.enqueue(􏰘) 􏰥 􏰃􏰐􏰐 􏱂 􏰘􏰂 􏰄􏰉􏰐 􏰂􏰊 􏰜􏰚􏰄􏰚􏰄
q.dequeue() 􏰥 􏰎􏰂􏰎 􏰦􏰗􏰒􏰘 􏰋􏰘􏰄􏰙 􏰂􏰊 􏰜􏰚􏰄􏰚􏰄􏰝 􏰗􏰄􏰘􏰚􏰗􏰉 􏰘􏰈􏰄 􏰋􏰘􏰄􏰙 q.is_empt􏰚() 􏰥 􏰟􏰈􏰄􏰟􏰅 􏰋􏰊 􏰜􏰚􏰄􏰚􏰄 􏰋􏰒 􏰄􏰙􏰎􏰘􏰠􏰝 􏰗􏰄􏰘􏰚􏰗􏰉 􏰽􏰗􏰚􏰄􏰳􏰡􏰃􏰏􏰒􏰄
􏰽􏰈􏰄 􏰛􏰄􏰃􏰚􏰘􏰠 􏰂􏰊 􏰘􏰈􏰋􏰒 􏰋􏰒 􏰘􏰈􏰃􏰘 􏰤􏰄 􏰐􏰂􏰉􏰩􏰘 􏰉􏰄􏰄􏰐 􏰘􏰂 􏰅􏰉􏰂􏰤 􏰘􏰈􏰄 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰐􏰄􏰘􏰃􏰋􏰏􏰒 􏰥 􏰤􏰄 􏰟􏰃􏰉 􏰆􏰚􏰒􏰘 􏰚􏰒􏰄 􏰘􏰈􏰄􏰒􏰄 􏰙􏰄􏰘􏰈􏰂􏰐􏰒 􏰘􏰂 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰘􏰈􏰄 􏰲􏰡􏰑 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏰧􏰊 􏰠􏰂􏰚􏰩􏰐 􏰏􏰋􏰅􏰄 􏰘􏰂 􏰍􏰂 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰈􏰂􏰤 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄 􏰤􏰂􏰗􏰅􏰒 􏰋􏰉 􏰐􏰄􏰘􏰃􏰋􏰏􏰝 􏰠􏰂􏰚 􏰟􏰃􏰉 􏰄􏱂􏰃􏰙􏰋􏰉􏰄 􏰘􏰈􏰄 􏰟􏰂􏰐􏰄 􏰋􏰉 ses07_data_structures.p􏰚 􏰢
􏱄􏰂􏰚 􏰟􏰃􏰉 􏰘􏰗􏰠 􏰘􏰈􏰄􏰒􏰄 􏰙􏰄􏰘􏰈􏰂􏰐􏰒 􏰋􏰉 􏰑􏰎􏰠􏰐􏰄􏰗􏰩􏰒 􏰟􏰂􏰉􏰒􏰂􏰏􏰄 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰊􏰂􏰏􏰏􏰂􏰤􏰋􏰉􏰍 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰒􏰕
q = Queue()
q.enqueue(‘Ralf’)
q.enqueue(‘Sophie’)
print(q)
q.enqueue(‘Lu’)
print(q)
first_one_out = q.dequeue()
print(‘The first in the queue was: ‘ + first_one_out + ‘, but we just popped the
m out.’)
print(q)
print(q.is_empt􏰚())
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
7/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰽􏰂 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰲􏰡􏰑􏰝 􏰠􏰂􏰚 􏰤􏰋􏰏􏰏 􏰃􏰏􏰒􏰂 􏰉􏰄􏰄􏰐 􏰂􏰉􏰄 􏰂􏰊 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰙􏰄􏰘􏰈􏰂􏰐􏰒􏰕 graph.children_of(v) 􏰥 􏰗􏰄􏰘􏰚􏰗􏰉􏰒 􏰉􏰂􏰐􏰄 v 􏰩􏰒 􏰉􏰄􏰋􏰍􏰈􏰛􏰂􏰗􏰋􏰉􏰍 􏰉􏰂􏰐􏰄􏰒
􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄􏰘􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 bfs 􏰋􏰉 ses07.p􏰚􏰢􏱄􏰂􏰚􏰟􏰃􏰉􏰘􏰄􏰒􏰘􏰠􏰂􏰚􏰗􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰤􏰋􏰘􏰈 p􏰚thon ok -q bfs
􏰧􏰉􏰂􏰗􏰐􏰄􏰗􏰘􏰂􏰟􏰃􏰏􏰟􏰚􏰏􏰃􏰘􏰄􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒􏰝􏰤􏰄􏰩􏰏􏰏􏰃􏰐􏰐􏰃􏰌􏰃􏰗􏰋􏰃􏰛􏰏􏰄 dists 􏰶􏰃􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠􏰷􏰤􏰈􏰋􏰟􏰈􏰅􏰄􏰄􏰎􏰒􏰘􏰗􏰃􏰟􏰅􏰂􏰊􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒􏰘􏰂 􏰃􏰏􏰏􏰉􏰂􏰐􏰄􏰒􏰢􏰑􏰎􏰄􏰟􏰋􏰦􏰟􏰃􏰏􏰏􏰠􏰝􏰋􏰘􏰒􏰈􏰂􏰚􏰏􏰐􏰛􏰄􏰋􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄􏰐􏰘􏰂􏰿􏰄􏰗􏰂􏰊􏰂􏰗􏰘􏰈􏰄 start 􏰉􏰂􏰐􏰄􏰢􏰽􏰈􏰄􏰉􏰝􏰤􏰈􏰄􏰉􏰤􏰄􏰗􏰄􏰃􏰟􏰈􏰉􏰂􏰐􏰄 􏰟􏰂􏰙􏰋􏰉􏰍 􏰊􏰗􏰂􏰙 􏰉􏰂􏰐􏰄 􏰝 􏰉􏰂􏰐􏰄 􏰩􏰒 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰒􏰈􏰂􏰚􏰏􏰐 􏰛􏰄 􏰒􏰄􏰘 􏰂􏰉􏰄 􏰈􏰋􏰍􏰈􏰄􏰗 􏰘􏰈􏰃􏰉 􏰘􏰈􏰃􏰘 􏰂􏰊 􏰉􏰂􏰐􏰄 􏰢
􏰼􏰊􏰘􏰄􏰗 􏰠􏰂􏰚 􏰟􏰂􏰙􏰎􏰏􏰄􏰘􏰄 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰝 􏰗􏰚􏰉 􏰋􏰘 􏰂􏰉 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰤􏰄 􏰚􏰒􏰄􏰐 􏰃􏰒 􏰃􏰉 􏰄􏱂􏰃􏰙􏰎􏰏􏰄 􏰋􏰉 􏰘􏰈􏰄 􏰏􏰄􏰟􏰘􏰚􏰗􏰄􏰢 􏰨􏰂 􏰠􏰂􏰚 􏰍􏰄􏰘 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰗􏰄􏰒􏰚􏰏􏰘􏱃
􏱊􏰂􏰘􏰄 􏰈􏰂􏰤􏰄􏰌􏰄􏰗􏰝 􏰘􏰈􏰃􏰘 􏰊􏰂􏰗 􏰉􏰂􏰤 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰐􏰂􏰄􏰒 􏰉􏰂􏰘 􏰅􏰄􏰄􏰎 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 􏰘􏰈􏰄 􏰃􏰟􏰘􏰚􏰃􏰏 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒􏰢 􏰣􏰄 􏰟􏰃􏰉 􏰟􏰂􏰉􏰒􏰘􏰗􏰚􏰟􏰘 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒 􏰚􏰒􏰋􏰉􏰍 􏰃 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰘􏰈􏰃􏰘 􏰒􏰘􏰂􏰗􏰄􏰒 􏰘􏰈􏰄 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰉􏰂􏰐􏰄 􏰊􏰂􏰗 􏰄􏰌􏰄􏰗􏰠 􏰉􏰂􏰐􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐􏰝 􏰘􏰈􏰃􏰘 􏰋􏰒􏰝 􏰊􏰂􏰗 􏰄􏰌􏰄􏰗􏰠 􏰉􏰂􏰐􏰄 􏰘􏰈􏰃􏰘 􏰤􏰄 􏰦􏰉􏰐􏰝 􏰋􏰘 􏰒􏰘􏰂􏰗􏰄􏰒 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄 􏰊􏰗􏰂􏰙 􏰤􏰈􏰋􏰟􏰈 􏰤􏰄 􏰃􏰗􏰗􏰋􏰌􏰄􏰢
􏰡􏰂􏰗 􏰱􏰂􏰈􏰉􏰝 􏰘􏰈􏰄􏰗􏰄 􏰋􏰒 􏰉􏰂 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰉􏰂􏰐􏰄􏰝 􏰒􏰂 􏰘􏰈􏰄 􏰌􏰃􏰏􏰚􏰄 􏰒􏰈􏰂􏰚􏰏􏰐 􏰛􏰄 None 􏰢 􏰡􏰂􏰗 􏰾􏰄􏰏􏰄􏰉􏰃􏰝 􏰤􏰄 􏰊􏰂􏰚􏰉􏰐 􏰈􏰄􏰗 􏰦􏰗􏰒􏰘 􏰊􏰗􏰂􏰙 􏰱􏰂􏰈􏰉􏰝􏰒􏰂􏰘􏰈􏰄􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒􏰉􏰂􏰐􏰄􏰒􏰈􏰂􏰚􏰏􏰐􏰛􏰄 John􏰝􏰃􏰉􏰐􏰒􏰂􏰂􏰉􏰢
􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄 􏰘􏰈􏰄 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 bfs_track_path 􏰋􏰉 ses07.p􏰚 􏰢 􏱄􏰂􏰚 􏰟􏰃􏰉 􏰘􏰄􏰒􏰘 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰤􏰋􏰘􏰈 p􏰚thon ok -q bfs_track_path
􏰯􏰉􏰟􏰄􏰠􏰂􏰚􏰩􏰌􏰄􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰄􏰐􏰘􏰈􏰋􏰒􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉􏰝􏰠􏰂􏰚􏰟􏰃􏰉􏰚􏰒􏰄􏰘􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 print_paths 􏰋􏰉􏰟􏰏􏰚􏰐􏰄􏰐􏰋􏰉􏰘􏰈􏰄􏰦􏰏􏰄􏰘􏰂􏰎􏰗􏰋􏰉􏰘 􏰘􏰈􏰄 􏰎􏰃􏰘􏰈􏰕
dists, prev_nodes = bfs_track_path(g, ‘John’)
print_path(prev_nodes, ‘Donald’)
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
8/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰑􏰙􏰃􏰏􏰏 􏰤􏰂􏰗􏰏􏰐􏰒 􏰃􏰉􏰐 􏰰􏰄􏰌􏰋􏰉 􏰲􏰃􏰟􏰂􏰉 􏰉􏰚􏰙􏰛􏰄􏰗􏰒
􏰣􏰄􏰩􏰏􏰏 􏰉􏰄􏱂􏰘 􏰚􏰒􏰄 􏰘􏰈􏰄 􏰲􏰡􏰑 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰘􏰂 􏰄􏱂􏰃􏰙􏰋􏰉􏰄 􏰘􏰈􏰄 􏰒􏰙􏰃􏰏􏰏 􏰤􏰂􏰗􏰏􏰐􏰒 􏰎􏰈􏰄􏰉􏰂􏰙􏰄􏰉􏰂􏰉 􏰂􏰉 􏰃 􏰏􏰃􏰗􏰍􏰄 􏰙􏰂􏰌􏰋􏰄 􏰐􏰃􏰘􏰃􏰒􏰄􏰘 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰧􏰉􏰘􏰄􏰗􏰉􏰄􏰘 􏰸􏰂􏰌􏰋􏰄 􏰨􏰃􏰘􏰃􏰛􏰃􏰒􏰄􏰢 􏰽􏰈􏰄 􏰋􏰐􏰄􏰃 􏰒􏰋􏰙􏰎􏰏􏰄􏰕 􏰄􏰌􏰄􏰗􏰠􏰂􏰉􏰄 􏰋􏰉 􏰘􏰈􏰄 􏰤􏰂􏰗􏰏􏰐 􏰋􏰒 􏰎􏰚􏰗􏰎􏰂􏰗􏰘􏰄􏰐􏰏􏰠 􏰟􏰂􏰉􏰉􏰄􏰟􏰘􏰄􏰐 􏰛􏰠 􏰃 􏰒􏰚􏰗􏰎􏰗􏰋􏰒􏰋􏰉􏰍􏰏􏰠 􏰒􏰙􏰃􏰏􏰏 􏰉􏰚􏰙􏰛􏰄􏰗 􏰂􏰊 􏰟􏰂􏰉􏰉􏰄􏰟􏰘􏰋􏰂􏰉􏰒 􏰋􏰉 􏰃 􏰒􏰂􏰟􏰋􏰃􏰏 􏰍􏰗􏰃􏰎􏰈􏰢 􏱄􏰂􏰚􏰩􏰏􏰏 􏰘􏰄􏰒􏰘 􏰘􏰈􏰋􏰒 􏰋􏰐􏰄􏰃 􏰛􏰠 􏰦􏰉􏰐􏰋􏰉􏰍 􏰘􏰈􏰄 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰛􏰄􏰘􏰤􏰄􏰄􏰉 􏰾􏰂􏰏􏰏􏰠􏰤􏰂􏰂􏰐 􏰃􏰟􏰘􏰂􏰗􏰒􏰢 􏰬􏰂􏰉􏰉􏰄􏰟􏰘􏰋􏰂􏰉􏰒 􏰛􏰄􏰘􏰤􏰄􏰄􏰉 􏰃􏰟􏰘􏰂􏰗􏰒 􏰃􏰗􏰄 􏰐􏰄􏰦􏰉􏰄􏰐 􏰃􏰒 􏰙􏰂􏰌􏰋􏰄􏰒 􏰤􏰈􏰄􏰗􏰄 􏰘􏰈􏰄􏰠 􏰃􏰟􏰘􏰄􏰐 􏰘􏰂􏰍􏰄􏰘􏰈􏰄􏰗􏰢 􏰡􏰂􏰗 􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰝 􏰘􏰈􏰄 􏰎􏰗􏰂􏰏􏰋􏰦􏰟 􏰃􏰟􏰘􏰂􏰗 􏰰􏰄􏰌􏰋􏰉 􏰲􏰃􏰟􏰂􏰉 􏰋􏰒 􏰒􏰃􏰋􏰐 􏰘􏰂 􏰛􏰄 􏰌􏰄􏰗􏰠 􏰤􏰄􏰏􏰏 􏰟􏰂􏰉􏰉􏰄􏰟􏰘􏰄􏰐 􏰛􏰠 􏰘􏰈􏰋􏰒 􏰙􏰄􏰃􏰒􏰚􏰗􏰄􏰢
􏰽􏰈􏰄􏰦􏰏􏰄 moviesg.t􏰘t 􏰟􏰂􏰉􏰘􏰃􏰋􏰉􏰒􏰃􏰒􏰙􏰃􏰏􏰏􏰒􏰃􏰙􏰎􏰏􏰄􏰂􏰊􏰙􏰂􏰌􏰋􏰄􏰐􏰃􏰘􏰃􏱅􏰃􏰏􏰃􏰗􏰍􏰄􏰗􏰒􏰃􏰙􏰎􏰏􏰄􏰋􏰒􏰎􏰗􏰂􏰌􏰋􏰐􏰄􏰐􏰋􏰉 movies.t􏰘t 􏰢 􏰽􏰈􏰄􏰒􏰄 􏰐􏰃􏰘􏰃 􏰃􏰗􏰄 􏰃􏰌􏰃􏰋􏰏􏰃􏰛􏰏􏰄 􏰊􏰗􏰄􏰄􏰏􏰠 􏰊􏰗􏰂􏰙 􏰧􏰸􏰨􏰲􏰝 􏰘􏰈􏰄 􏰟􏰏􏰄􏰃􏰉􏰄􏰐 􏰐􏰃􏰘􏰃 􏰋􏰒 􏰟􏰂􏰚􏰗􏰘􏰄􏰒􏰠 􏰂􏰊 􏰫􏰂􏰛􏰄􏰗􏰘
􏰑􏰄􏰐􏰍􏰄􏰤􏰋􏰟􏰅􏰝􏰪􏰗􏰋􏰉􏰟􏰄􏰘􏰂􏰉􏱋􏰉􏰋􏰌􏰄􏰗􏰒􏰋􏰘􏰠􏰢􏰽􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 read_movie_data 􏰋􏰒􏰎􏰗􏰂􏰌􏰋􏰐􏰄􏰐􏰋􏰉􏰘􏰈􏰄􏰟􏰂􏰐􏰄􏰦􏰏􏰄􏰘􏰂􏰗􏰄􏰃􏰐􏰘􏰈􏰋􏰒 􏰐􏰃􏰘􏰃 􏰋􏰉􏰘􏰂 􏰃 􏰍􏰗􏰃􏰎􏰈􏰢
􏰸􏰃􏰅􏰄 􏰒􏰚􏰗􏰄 􏰘􏰂 􏰒􏰄􏰘 􏰘􏰈􏰄 􏰤􏰂􏰗􏰅􏰋􏰉􏰍 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠 􏰟􏰂􏰗􏰗􏰄􏰟􏰘􏰏􏰠 􏰋􏰉 􏰑􏰎􏰠􏰐􏰄􏰗 􏰛􏰄􏰊􏰂􏰗􏰄 􏰗􏰄􏰃􏰐􏰋􏰉􏰍 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃􏰢 􏱄􏰂􏰚 􏰟􏰃􏰉 􏰟􏰈􏰃􏰉􏰍􏰄 􏰘􏰈􏰄 􏰐􏰋􏰗􏰄􏰟􏰘􏰂􏰗􏰠 􏰂􏰉 􏰘􏰈􏰄 􏰘􏰂􏰎 􏰗􏰋􏰍􏰈􏰘 􏰟􏰂􏰗􏰉􏰄􏰗 􏰂􏰊 􏰘􏰈􏰄 􏰎􏰗􏰂􏰍􏰗􏰃􏰙􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏱈
􏱋􏰒􏰄 􏰠􏰂􏰚􏰗 􏰲􏰡􏰑 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰘􏰂 􏰦􏰉􏰐 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰃􏰉􏰐 􏰎􏰃􏰘􏰈􏰒 􏰊􏰗􏰂􏰙 􏰰􏰄􏰌􏰋􏰉 􏰲􏰃􏰟􏰂􏰉 􏰘􏰂 􏰃􏰟􏰘􏰂􏰗􏰒 􏱊􏰋􏰟􏰂􏰏􏰄 􏰰􏰋􏰐􏰙􏰃􏰉 􏰃􏰉􏰐 􏰸􏰃􏰗􏰏􏰂􏰉 􏰲􏰗􏰃􏰉􏰐􏰂􏰢 􏰣􏰈􏰃􏰘 􏰋􏰒 􏰘􏰈􏰄 􏰏􏰃􏰗􏰍􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰊􏰗􏰂􏰙 􏰰􏰄􏰌􏰋􏰉 􏰲􏰃􏰟􏰂􏰉 􏰋􏰉 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈􏱃 􏰣􏰈􏰃􏰘 􏰋􏰒 􏰘􏰈􏰄 􏰐􏰋􏰒􏰘􏰗􏰋􏰛􏰚􏰘􏰋􏰂􏰉 􏰂􏰊 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒􏱃 􏱊􏰂􏰘􏰋􏰟􏰄 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰤􏰋􏰏􏰏 􏰂􏰚􏰘􏰎􏰚􏰘 􏰐􏰂􏰚􏰛􏰏􏰄 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄􏰒􏰄 􏰐􏰃􏰘􏰃􏰝 􏰃􏰒 􏰋􏰘 􏰤􏰋􏰏􏰏 􏰟􏰂􏰚􏰉􏰘 􏰘􏰈􏰄 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰊􏰗􏰂􏰙 􏰃􏰉 􏰃􏰟􏰘􏰂􏰗 􏰘􏰂 􏰃 􏰙􏰂􏰌􏰋􏰄 􏰃􏰒 􏰂􏰉􏰄 􏰄􏰐􏰍􏰄 􏰃􏰉􏰐 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰙􏰂􏰌􏰋􏰄 􏰘􏰂 􏰃􏰉􏰂􏰘􏰈􏰄􏰗 􏰃􏰟􏰘􏰂􏰗 􏰃􏰒 􏰃􏰉􏰂􏰘􏰈􏰄􏰗 􏰂􏰉􏰄􏰢
􏰽􏰈􏰄􏰗􏰄 􏰃􏰗􏰄 􏰉􏰂 􏰘􏰄􏰒􏰘􏰒 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏰥 􏰋􏰘 􏰋􏰒 􏰏􏰄􏰊􏰘 􏰊􏰂􏰗 􏰠􏰂􏰚 􏰘􏰂 􏰄􏱂􏰎􏰏􏰂􏰗􏰄 􏰘􏰈􏰄 􏰙􏰂􏰌􏰋􏰄 􏰉􏰄􏰘􏰤􏰂􏰗􏰅􏰢 􏰣􏰈􏰃􏰘 􏰃􏰗􏰄 􏰘􏰈􏰄 􏰏􏰃􏰗􏰍􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰊􏰗􏰂􏰙 􏰰􏰄􏰌􏰋􏰉 􏰲􏰃􏰟􏰂􏰉 􏰠􏰂􏰚 􏰟􏰃􏰉 􏰦􏰉􏰐􏱃
􏰾􏰄􏰗􏰄 􏰃􏰗􏰄 􏰒􏰂􏰙􏰄 􏰋􏰐􏰄􏰃􏰒 􏰘􏰂 􏰍􏰄􏰘 􏰠􏰂􏰚 􏰒􏰘􏰃􏰗􏰘􏰄􏰐􏰕
g = read_movie_data(“movies.t􏰘t”)
s = ‘Bacon, Kevin’
print_children(g, s)
dists, prev_nodes = bfs_track_path(g, s)
to_find = ‘Kidman, Nicole’
print_path(prev_nodes, to_find)
􏰧􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
9/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰣􏰄􏰋􏰍􏰈􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰒
􏰣􏰄􏰩􏰌􏰄 􏰉􏰂􏰤 􏰒􏰘􏰃􏰗􏰘􏰄􏰐 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰍􏰗􏰃􏰎􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒􏰝 􏰒􏰎􏰄􏰟􏰋􏰦􏰟􏰃􏰏􏰏􏰠 􏰘􏰈􏰄 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰶􏰲􏰡􏰑􏰷􏰢 􏰽􏰈􏰋􏰒 􏰃􏰏􏰏􏰂􏰤􏰄􏰐 􏰚􏰒 􏰘􏰂 􏰦􏰉􏰐 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈 􏰛􏰄􏰘􏰤􏰄􏰄􏰉 􏰘􏰤􏰂 􏰉􏰂􏰐􏰄􏰒 􏰂􏰊 􏰃 􏰍􏰗􏰃􏰎􏰈 􏰶􏰒􏰚􏰟􏰈 􏰃􏰒 􏰰􏰄􏰌􏰋􏰉 􏰲􏰃􏰟􏰂􏰉 􏰃􏰉􏰐 􏱊􏰋􏰟􏰂􏰏􏰄 􏰰􏰋􏰐􏰙􏰃􏰉 􏰋􏰉 􏰘􏰈􏰄 􏰉􏰄􏰘􏰤􏰂􏰗􏰅 􏰂􏰊 􏰾􏰂􏰏􏰏􏰠􏰤􏰂􏰂􏰐 􏰃􏰟􏰘􏰂􏰗􏰒􏰷􏰢
􏰽􏰈􏰄 􏰲􏰡􏰑 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰒􏰒􏰚􏰙􏰄􏰒 􏰘􏰈􏰃􏰘 􏰍􏰗􏰃􏰎􏰈 􏰄􏰐􏰍􏰄􏰒 􏰃􏰗􏰄 􏰚􏰉􏰤􏰄􏰋􏰍􏰈􏰘􏰄􏰐 􏰶􏰂􏰗 􏰃􏰏􏰏 􏰈􏰃􏰌􏰄 􏰄􏰜􏰚􏰃􏰏 􏰤􏰄􏰋􏰍􏰈􏰘􏰒􏰷􏰝 􏰤􏰈􏰋􏰟􏰈 􏰦􏰘􏰒 􏰒􏰂􏰙􏰄 􏰉􏰄􏰘􏰤􏰂􏰗􏰅􏰒􏰢 􏰲􏰚􏰘 􏰤􏰈􏰄􏰉 􏰄􏰐􏰍􏰄􏰒 􏰈􏰃􏰌􏰄 􏰤􏰄􏰋􏰍􏰈􏰘􏰒 􏰶􏰏􏰄􏰉􏰍􏰘􏰈􏰒􏰝 􏰟􏰂􏰒􏰘􏰒􏰷 􏰃􏰒􏰒􏰂􏰟􏰋􏰃􏰘􏰄􏰐 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄􏰙􏰝 􏰤􏰄 􏰉􏰄􏰄􏰐 􏰃 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰘􏰂 􏰦􏰉􏰐 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒􏰢 􏰣􏰄􏰩􏰏􏰏 􏰉􏰄􏱂􏰘 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘􏰥􏰎􏰃􏰘􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰎􏰚􏰗􏰎􏰂􏰒􏰄􏰢
􏰣􏰄􏰩􏰏􏰏􏰃􏰐􏰃􏰎􏰘􏰂􏰚􏰗 Graph 􏰟􏰂􏰐􏰄􏰊􏰗􏰂􏰙􏰏􏰃􏰒􏰘􏰘􏰋􏰙􏰄􏰘􏰂􏰐􏰄􏰃􏰏􏰤􏰋􏰘􏰈􏰤􏰄􏰋􏰍􏰈􏰘􏰄􏰐􏰄􏰐􏰍􏰄􏰒􏰢􏰣􏰄􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰄􏰐􏰃􏰍􏰗􏰃􏰎􏰈􏰚􏰒􏰋􏰉􏰍􏰃􏰉 􏰃􏰐􏰆􏰃􏰟􏰄􏰉􏰟􏰠 􏰏􏰋􏰒􏰘􏰝 􏰒􏰎􏰄􏰟􏰋􏰦􏰟􏰃􏰏􏰏􏰠 􏰃 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰤􏰈􏰄􏰗􏰄 􏰘􏰈􏰄 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰅􏰄􏰠􏰒 􏰤􏰄􏰗􏰄 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰘􏰈􏰄 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰌􏰃􏰏􏰚􏰄􏰒 􏰤􏰄􏰗􏰄 􏰒􏰄􏰘􏰒 􏰂􏰊 􏰂􏰘􏰈􏰄􏰗 􏰉􏰂􏰐􏰄􏰒 􏰘􏰈􏰋􏰒 􏰉􏰂􏰐􏰄 􏰤􏰃􏰒 􏰟􏰂􏰉􏰉􏰄􏰟􏰘􏰄􏰐 􏰘􏰂􏰢 􏱊􏰂􏰤 􏰤􏰄􏰩􏰏􏰏 􏰃􏰐􏰆􏰚􏰒􏰘 􏰘􏰈􏰋􏰒 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰘􏰂 􏰋􏰉􏰟􏰏􏰚􏰐􏰄 􏰄􏰐􏰍􏰄 􏰤􏰄􏰋􏰍􏰈􏰘􏰒􏰢 􏰣􏰄􏰩􏰏􏰏 􏰃􏰐􏰐 􏰘􏰈􏰄 􏰤􏰄􏰋􏰍􏰈􏰘􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰌􏰃􏰏􏰚􏰄􏰒􏰝 􏰤􏰈􏰋􏰟􏰈 􏰤􏰋􏰏􏰏 􏰛􏰄􏰟􏰂􏰙􏰄 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰋􏰄􏰒 􏰘􏰈􏰄􏰙􏰒􏰄􏰏􏰌􏰄􏰒 􏰋􏰉􏰒􏰘􏰄􏰃􏰐 􏰂􏰊 􏰒􏰄􏰘􏰒􏰢 􏰾􏰄􏰗􏰄􏰩􏰒 􏰃􏰉 􏰄􏱂􏰃􏰙􏰎􏰏􏰄 􏰃􏰐􏰆􏰃􏰟􏰄􏰉􏰟􏰠 􏰏􏰋􏰒􏰘 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰂􏰊 􏰃 􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈 􏰤􏰋􏰘􏰈 􏰤􏰄􏰋􏰍􏰈􏰘􏰒􏰢 􏰽􏰗􏰠 􏰐􏰗􏰃􏰤􏰋􏰉􏰍 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰂􏰉 􏰃 􏰎􏰋􏰄􏰟􏰄 􏰂􏰊 􏰎􏰃􏰎􏰄􏰗􏰢
distances = 􏰤
‘a’: 􏰤’b’: 4, ‘c’: 2􏰠,
‘b’: 􏰤’c’: 1, ‘d’: 1􏰠,
‘c’: 􏰤’d’: 3􏰠,
‘d’: 􏰤􏰠
􏰠
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏱆􏰕 􏱍􏰄􏰟􏰘􏰚􏰗􏰄 􏰍􏰗􏰃􏰎􏰈
􏰣􏰗􏰋􏰘􏰄􏰘􏰈􏰄􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰊􏰗􏰂􏰙􏰘􏰈􏰄􏰏􏰄􏰟􏰘􏰚􏰗􏰄􏰃􏰒􏰃􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠􏰢􏰡􏰂􏰗􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰝􏰘􏰈􏰄􏰤􏰄􏰋􏰍􏰈􏰘􏰂􏰊􏰘􏰈􏰄􏰄􏰐􏰍􏰄􏰊􏰗􏰂􏰙 a 􏰘􏰂 b 􏰒􏰈􏰂􏰚􏰏􏰐􏰭􏰢􏱊􏰂􏰘􏰋􏰟􏰄􏰘􏰈􏰃􏰘􏰘􏰈􏰋􏰒􏰋􏰒􏰃􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐􏰍􏰗􏰃􏰎􏰈􏰕􏰊􏰂􏰗􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰝􏰘􏰈􏰄􏰗􏰄􏰋􏰒􏰉􏰂􏰄􏰐􏰍􏰄􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍􏰊􏰗􏰂􏰙􏰉􏰂􏰐􏰄 e􏰢􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰋􏰉 􏰘􏰈􏰄 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 lecture_graph 􏰋􏰉 ses07_weighted.p􏰚 􏰢 􏱄􏰂􏰚 􏰟􏰃􏰉 􏰘􏰄􏰒􏰘 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰤􏰋􏰘􏰈
p􏰚thon ok -q lecture_graph
􏰽􏰈􏰄􏰪􏰠􏰘􏰈􏰂􏰉􏰦􏰏􏰄 ses07_weighted_graphs.p􏰚 􏰟􏰂􏰉􏰘􏰃􏰋􏰉􏰒􏰘􏰈􏰄􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰒􏰂􏰊 Digraph 􏰃􏰉􏰐 Graph 􏰊􏰂􏰗 􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰃􏰉􏰐 􏰚􏰉􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰒􏰢 􏰽􏰈􏰄􏰒􏰄 􏰃􏰗􏰄 􏰒􏰋􏰙􏰋􏰏􏰃􏰗 􏰘􏰂 􏰘􏰈􏰄 􏰂􏰉􏰄􏰒 􏰤􏰄 􏰚􏰒􏰄􏰐 􏰋􏰉 􏰘􏰈􏰄 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰘􏰚􏰘􏰂􏰗􏰋􏰃􏰏􏰝 􏰛􏰚􏰘 􏰤􏰋􏰘􏰈 􏰄􏰐􏰍􏰄 􏰤􏰄􏰋􏰍􏰈􏰘􏰒􏰢
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
10/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘􏰥􏰎􏰃􏰘􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙
􏱊􏰄􏱂􏰘􏰝 􏰏􏰄􏰘􏰩􏰒 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰊􏰂􏰗 􏰦􏰉􏰐􏰋􏰉􏰍 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒􏰢 􏰣􏰄􏰩􏰏􏰏 􏰒􏰘􏰃􏰗􏰘 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰃􏰎􏰎􏰗􏰂􏰃􏰟􏰈 􏰤􏰄 􏰤􏰄􏰉􏰘 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰋􏰉 􏰘􏰈􏰄 􏰏􏰄􏰟􏰘􏰚􏰗􏰄􏰝 􏰤􏰈􏰋􏰟􏰈 􏰍􏰋􏰌􏰄􏰒 􏰚􏰒 􏰃 􏰎􏰂􏰏􏰠􏰉􏰂􏰙􏰋􏰃􏰏 􏰗􏰚􏰉􏰉􏰋􏰉􏰍 􏰘􏰋􏰙􏰄 􏰢 􏰧􏰉 􏰘􏰈􏰄 􏰄􏱂􏰘􏰗􏰃 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰝 􏰠􏰂􏰚􏰩􏰏􏰏 􏰈􏰃􏰌􏰄 􏰃 􏰟􏰈􏰃􏰉􏰟􏰄 􏰘􏰂 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰃 􏰙􏰚􏰟􏰈 􏰊􏰃􏰒􏰘􏰄􏰗 􏰌􏰄􏰗􏰒􏰋􏰂􏰉 􏰂􏰊 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰚􏰒􏰋􏰉􏰍 􏰃 􏰈􏰄􏰃􏰎 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰢
􏰾􏰄􏰗􏰄 􏰃􏰗􏰄 􏰘􏰈􏰄 􏰒􏰘􏰄􏰎􏰒 􏰂􏰊 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏰧􏰘 􏰤􏰂􏰗􏰅􏰒 􏰂􏰉 􏰃 􏰍􏰗􏰃􏰎􏰈 􏰤􏰈􏰄􏰗􏰄 􏰘􏰈􏰄 􏰒􏰄􏰘 􏰂􏰊 􏰉􏰂􏰐􏰄􏰒 􏰶􏰌􏰄􏰗􏰘􏰋􏰟􏰄􏰒􏰷 􏰋􏰒 􏰝 􏰃􏰉􏰐 􏰄􏰐􏰍􏰄􏰒 􏰢
􏰧􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰒􏰃􏰘􏰋􏰂􏰉􏰕 􏰶􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰊􏰗􏰂􏰙 􏰉􏰂􏰐􏰄 􏰷
􏰣􏰄 􏰒􏰘􏰂􏰗􏰄 􏰘􏰈􏰄 􏰒􏰄􏰘 􏰂􏰊 􏰉􏰂􏰐􏰄􏰒 􏰤􏰄 􏰈􏰃􏰌􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰶􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐􏰷 􏰒􏰂 􏰊􏰃􏰗 􏰋􏰉 􏰘􏰈􏰄 􏰒􏰄􏰘
􏰤􏰄 􏰃􏰐􏰐 􏰘􏰈􏰄 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰉􏰂􏰐􏰄 􏰘􏰂 􏰢
􏰣􏰄 􏰒􏰘􏰂􏰗􏰄 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰊􏰗􏰂􏰙 􏰘􏰂 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰢 􏰧􏰉􏰋􏰘􏰋􏰃􏰏􏰏􏰠 􏰤􏰄 􏰒􏰄􏰘 􏰘􏰈􏰄 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰉􏰂􏰐􏰄 􏰘􏰂 􏰋􏰘􏰒􏰄􏰏􏰊 􏰘􏰂 􏰿􏰄􏰗􏰂􏰕 􏰢
􏰢 􏰽􏰈􏰋􏰒 􏰒􏰄􏰘 􏰒􏰘􏰃􏰗􏰘􏰒 􏰄􏰙􏰎􏰘􏰠􏰝 􏰄􏱂􏰟􏰄􏰎􏰘
􏰸􏰃􏰋􏰉 􏰏􏰂􏰂􏰎􏰝 􏰗􏰄􏰎􏰄􏰃􏰘􏰄􏰐 􏰤􏰈􏰋􏰏􏰄 􏰤􏰄 􏰈􏰃􏰌􏰄􏰉􏰩􏰘 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒􏰕 􏰶􏰘􏰈􏰃􏰘 􏰋􏰒􏰝 􏰘􏰈􏰄 􏰒􏰄􏰘 􏰝 􏰂􏰗 􏰷􏰕
􏰋􏰒 􏰉􏰂􏰘 􏰄􏰜􏰚􏰃􏰏 􏰘􏰂 􏰘􏰈􏰄 􏰒􏰄􏰘 􏰂􏰊 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒
􏰣􏰄 􏰏􏰂􏰂􏰎 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰃􏰏􏰏 edge􏰒 􏰒􏰘a􏰗􏰘ing in node􏰒 􏰤e’􏰌e 􏰌i􏰒i􏰘ed 􏰃􏰉􏰐 ending in node􏰒 􏰤e ha􏰌e no􏰘 􏰌i􏰒i􏰘ed 􏰠e􏰘􏰢 􏰧􏰉 􏰂􏰘􏰈􏰄􏰗 􏰤􏰂􏰗􏰐􏰒􏰝 􏰤􏰄 􏰍􏰂 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰃􏰏􏰏 􏰄􏰐􏰍􏰄􏰒 􏰤􏰈􏰄􏰗􏰄 􏰋􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰒􏰄􏰘 􏰃􏰉􏰐 􏰋􏰒 􏰉􏰂􏰘 􏰋􏰉
􏰼􏰙􏰂􏰉􏰍 􏰘􏰈􏰄􏰒􏰄 􏰄􏰐􏰍􏰄􏰒􏰝 􏰤􏰄 􏰎􏰋􏰟􏰅 􏰘􏰈􏰄 􏰄􏰐􏰍􏰄 􏰘􏰈􏰃􏰘 􏰙􏰋􏰉􏰋􏰙􏰋􏰿􏰄􏰒 􏰘􏰈􏰄 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰝 􏰤􏰈􏰄􏰗􏰄 􏰋􏰒 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰘􏰂 􏰘􏰈􏰄 􏰃􏰏􏰗􏰄􏰃􏰐􏰠 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰉􏰂􏰐􏰄 􏰃􏰉􏰐 􏰋􏰒 􏰘􏰈􏰄 􏰄􏰐􏰍􏰄 􏰤􏰄􏰋􏰍􏰈􏰘 􏰊􏰗􏰂􏰙
􏰣􏰄 􏰙􏰃􏰅􏰄 􏰉􏰂􏰘􏰄 􏰂􏰊 􏰘􏰈􏰋􏰒 􏰙􏰋􏰉􏰋􏰙􏰚􏰙􏰥􏰒􏰟􏰂􏰗􏰄 􏰄􏰐􏰍􏰄􏰝 􏰟􏰃􏰏􏰏 􏰋􏰘 􏰢 􏰽􏰈􏰃􏰘 􏰋􏰒􏰝 􏰋􏰘 􏰒􏰘􏰃􏰗􏰘􏰒 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄 􏰃􏰉􏰐 􏰄􏰉􏰐􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄
􏰣􏰄 􏰃􏰐􏰐 􏰘􏰈􏰄 􏰄􏰉􏰐 􏰉􏰂􏰐􏰄 􏰘􏰂 􏰘􏰈􏰄 􏰒􏰄􏰘 􏰂􏰊 􏰉􏰂􏰐􏰄􏰒 􏰤􏰄 􏰈􏰃􏰌􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰝 􏰃􏰉􏰐 􏰒􏰄􏰘 􏰋􏰘􏰒 􏰙􏰋􏰉􏰋􏰙􏰚􏰙 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰘􏰂
􏰣􏰄 􏰘􏰈􏰄􏰉 􏰗􏰄􏰎􏰄􏰃􏰘 􏰘􏰈􏰄􏰒􏰄 􏰒􏰘􏰄􏰎􏰒 􏰚􏰉􏰘􏰋􏰏 􏰤􏰄􏰩􏰌􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒
􏰽􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 dijkstra 􏰋􏰉􏰘􏰈􏰄􏰪􏰠􏰘􏰈􏰂􏰉􏰦􏰏􏰄 ses07_weighted.p􏰚 􏰟􏰂􏰉􏰘􏰃􏰋􏰉􏰒􏰟􏰂􏰐􏰄􏰊􏰂􏰗􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏰯􏰚􏰗 􏰍􏰂􏰃􏰏 􏰋􏰒 􏰘􏰂 􏰚􏰉􏰐􏰄􏰗􏰒􏰘􏰃􏰉􏰐 􏰘􏰈􏰄 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰢
􏰖􏰂 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰘􏰈􏰄 􏰟􏰂􏰐􏰄 􏰃􏰉􏰐 􏰘􏰗􏰠 􏰘􏰂 􏰗􏰄􏰏􏰃􏰘􏰄 􏰄􏰃􏰟􏰈 􏰒􏰘􏰄􏰎 􏰘􏰂 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰛􏰂􏰌􏰄􏰢 􏰼 􏰍􏰂􏰂􏰐 􏰤􏰃􏰠 􏰘􏰂 􏰒􏰘􏰃􏰗􏰘 􏰋􏰒 􏰛􏰠 􏰏􏰂􏰂􏰅􏰋􏰉􏰍 􏰃􏰘 􏰘􏰈􏰄 􏰋􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰃􏰘􏰋􏰂􏰉 􏰒􏰘􏰄􏰎 􏰋􏰉 􏰘􏰈􏰄 􏰟􏰂􏰐􏰄 􏰃􏰉􏰐 􏰟􏰂􏰙􏰎􏰃􏰗􏰋􏰉􏰍 􏰋􏰘 􏰘􏰂 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰛􏰂􏰌􏰄􏰢 􏰽􏰗􏰠 􏰘􏰂 􏰟􏰂􏰉􏰉􏰄􏰟􏰘 􏰘􏰈􏰄 􏰪􏰠􏰘􏰈􏰂􏰉 􏰒􏰘􏰄􏰎􏰒 􏰘􏰂 􏰘􏰈􏰄 􏰒􏰘􏰄􏰎􏰒 􏰃􏰛􏰂􏰌􏰄􏰢 􏰽􏰈􏰄􏰉 􏰙􏰂􏰌􏰄 􏰋􏰉􏰘􏰂 􏰘􏰈􏰄 􏰙􏰃􏰋􏰉 􏰏􏰂􏰂􏰎􏰝 􏰙􏰃􏰅􏰋􏰉􏰍 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰟􏰂􏰙􏰎􏰃􏰗􏰋􏰒􏰂􏰉 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰛􏰂􏰌􏰄􏰢 􏰽􏰈􏰄 􏰟􏰂􏰙􏰙􏰄􏰉􏰘􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰦􏰏􏰄 􏰎􏰗􏰂􏰌􏰋􏰐􏰄 􏰈􏰋􏰉􏰘􏰒 􏰊􏰂􏰗 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰢
􏰧􏰉 􏰤􏰂􏰗􏰐􏰒􏰝 􏰄􏰃􏰟􏰈 􏰋􏰘􏰄􏰗􏰃􏰘􏰋􏰂􏰉 􏰂􏰊 􏰘􏰈􏰄 􏰙􏰃􏰋􏰉 􏰏􏰂􏰂􏰎 􏰤􏰋􏰏􏰏 􏰗􏰚􏰉 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰃􏰏􏰏 􏰄􏰐􏰍􏰄􏰒 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰊􏰗􏰂􏰙 􏰄􏰃􏰟􏰈 􏰉􏰂􏰐􏰄 􏰘􏰈􏰃􏰘 􏰤􏰄 􏰈􏰃􏰌􏰄 􏰃􏰏􏰗􏰄􏰃􏰐􏰠 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰶􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒 􏰋􏰉 􏰷 􏰚􏰒􏰋􏰉􏰍 􏰃 􏰉􏰄􏰒􏰘􏰄􏰐 􏰊􏰂􏰗 􏰏􏰂􏰂􏰎􏰢 􏰧􏰘 􏰟􏰈􏰄􏰟􏰅􏰒 􏰋􏰊 􏰘􏰈􏰄􏰒􏰄 􏰄􏰐􏰍􏰄􏰒 􏰄􏰉􏰐 􏰂􏰚􏰘􏰒􏰋􏰐􏰄 􏰂􏰊 􏰝 􏰃􏰉􏰐 􏰘􏰈􏰄􏰉 􏰟􏰃􏰏􏰟􏰚􏰏􏰃􏰘􏰄􏰒 􏰘􏰈􏰄 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰊􏰂􏰗 􏰘􏰈􏰄 􏰄􏰐􏰍􏰄􏰢 􏰼􏰙􏰂􏰉􏰍 􏰘􏰈􏰄􏰒􏰄 􏰄􏰐􏰍􏰄􏰒􏰝 􏰘􏰈􏰄 􏰏􏰂􏰂􏰎 􏰒􏰈􏰂􏰚􏰏􏰐 􏰎􏰋􏰟􏰅 􏰘􏰈􏰄 􏰂􏰉􏰄 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰃􏰒 􏰐􏰄􏰦􏰉􏰄􏰐 􏰃􏰛􏰂􏰌􏰄􏰢 􏰧􏰘 􏰅􏰄􏰄􏰎􏰒 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙 􏰒􏰟􏰂􏰗􏰄 􏰚􏰒􏰋􏰉􏰍 􏰘􏰈􏰄 􏰈􏰄􏰏􏰎􏰄􏰗 􏰌􏰃􏰗􏰋􏰃􏰛􏰏􏰄􏰒
min_dist, min_edge 􏰢 􏰧􏰘 􏰘􏰈􏰄􏰉 􏰚􏰒􏰄􏰒 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰄􏰐􏰍􏰄 􏰘􏰂 􏰃􏰐􏰐 􏰘􏰈􏰄 􏰐􏰄􏰒􏰘􏰋􏰉􏰃􏰘􏰋􏰂􏰉 􏰉􏰂􏰐􏰄 􏰘􏰂 􏰃􏰒 􏰐􏰄􏰒􏰟􏰗􏰋􏰛􏰄􏰐 􏰋􏰉 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰛􏰂􏰌􏰄􏰢
􏰽􏰄􏰒􏰘 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰂􏰉 􏰘􏰈􏰄 􏰏􏰄􏰟􏰘􏰚􏰗􏰄 􏰄􏱂􏰃􏰙􏰎􏰏􏰄 􏰍􏰗􏰃􏰎􏰈􏰢 􏰬􏰗􏰄􏰃􏰘􏰄 􏰘􏰈􏰄 􏰄􏱂􏰃􏰙􏰎􏰏􏰄 􏰍􏰗􏰃􏰎􏰈 􏰊􏰗􏰂􏰙 􏰠􏰂􏰚􏰗 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰚􏰒􏰋􏰉􏰍
graph = gs.Digraph(lecture_graph())
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
11/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏱇
􏰽􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰉􏰂􏰤 􏰟􏰂􏰗􏰗􏰄􏰟􏰘􏰏􏰠 􏰟􏰃􏰏􏰟􏰚􏰏􏰃􏰘􏰄􏰒 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰛􏰚􏰘 􏰐􏰂􏰄􏰒 􏰉􏰂􏰘 􏰠􏰄􏰘 􏰅􏰄􏰄􏰎 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒 􏰘􏰃􏰅􏰄􏰉􏰢 􏱍􏰄􏰘􏰩􏰒 􏰚􏰎􏰐􏰃􏰘􏰄 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰘􏰂 􏰃􏰏􏰒􏰂 􏰅􏰄􏰄􏰎 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 prev_nodes 􏰝 􏰤􏰈􏰋􏰟􏰈 􏰋􏰒 􏰃 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰂􏰊 􏰘􏰈􏰄 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰉􏰂􏰐􏰄 􏰂􏰉 􏰎􏰃􏰘􏰈 􏰘􏰂 􏰃􏰉􏰠 􏰉􏰂􏰐􏰄􏰢 􏰧􏰊 􏰤􏰄 􏰒􏰘􏰂􏰗􏰄 􏰘􏰈􏰄 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰉􏰂􏰐􏰄 􏰂􏰉 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰝 􏰤􏰄 􏰟􏰃􏰉 􏰛􏰃􏰟􏰅􏰘􏰗􏰃􏰟􏰅 􏰏􏰃􏰘􏰄􏰗 􏰘􏰂 􏰗􏰄􏰟􏰗􏰄􏰃􏰘􏰄 􏰘􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒􏰢
􏱄􏰂􏰚 􏰒􏰈􏰂􏰚􏰏􏰐 􏰙􏰃􏰅􏰄 􏰘􏰈􏰄 􏰊􏰂􏰏􏰏􏰂􏰤􏰋􏰉􏰍 􏰟􏰈􏰃􏰉􏰍􏰄 􏰋􏰉 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏰼􏰒 􏰠􏰂􏰚 􏰙􏰃􏰗􏰅 􏰃 􏰉􏰂􏰐􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐􏰝 􏰠􏰂􏰚 􏰒􏰈􏰂􏰚􏰏􏰐 􏰒􏰄􏰘 􏰘􏰈􏰄 􏰌􏰃􏰏􏰚􏰄 􏰂􏰊 prev_nodes 􏰘􏰂􏰛􏰄􏰘􏰈􏰄􏰒􏰂􏰚􏰗􏰟􏰄􏰉􏰂􏰐􏰄􏰊􏰗􏰂􏰙􏰤􏰈􏰋􏰟􏰈􏰘􏰈􏰄􏰟􏰚􏰗􏰗􏰄􏰉􏰘􏰉􏰂􏰐􏰄􏰤􏰃􏰒􏰌􏰋􏰒􏰋􏰘􏰄􏰐􏰢
􏱄􏰂􏰚 􏰟􏰃􏰉 􏰘􏰄􏰒􏰘 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰤􏰋􏰘􏰈 p􏰚thon ok -q dijkstra
􏰽􏰄􏰒􏰘􏰘􏰈􏰄􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰃􏰍􏰃􏰋􏰉􏰢􏱄􏰂􏰚􏰟􏰃􏰉􏰚􏰒􏰄􏰘􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 print_path 􏰘􏰂􏰎􏰗􏰋􏰉􏰘􏰂􏰚􏰘􏰘􏰈􏰄􏰎􏰃􏰘􏰈􏰊􏰗􏰂􏰙􏰘􏰈􏰄􏰒􏰘􏰃􏰗􏰘􏰉􏰂􏰐􏰄􏰘􏰂 􏰃􏰉􏰠 􏰂􏰘􏰈􏰄􏰗 􏰉􏰂􏰐􏰄􏰢
􏱀􏱂􏰘􏰗􏰃􏰢 (Yo􏰚 do no􏰘 need 􏰘o implemen􏰘 􏰘hi􏰒 pa􏰗􏰘.) 􏱊􏰂􏰘􏰋􏰟􏰄 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰃􏰒 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰄􏰐 􏰉􏰂􏰤 􏰃􏰒􏰒􏰚􏰙􏰄􏰒 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄􏰗􏰄 􏰋􏰒 􏰃 􏰎􏰃􏰘􏰈 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰒􏰘􏰃􏰗􏰘 􏰉􏰂􏰐􏰄 􏰘􏰂 􏰃􏰏􏰏 􏰂􏰘􏰈􏰄􏰗 􏰉􏰂􏰐􏰄􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈􏰢 􏰑􏰂􏰝 􏰋􏰉 􏰘􏰈􏰄 􏰐􏰋􏰗􏰄􏰟􏰘􏰄􏰐 􏰏􏰄􏰟􏰘􏰚􏰗􏰄 􏰍􏰗􏰃􏰎􏰈􏰝 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰊􏰗􏰂􏰙􏰃􏰉􏰂􏰐􏰄􏰂􏰘􏰈􏰄􏰗􏰘􏰈􏰃􏰉 a 􏰶􏰒􏰃􏰠􏰝 b􏰷􏰤􏰋􏰏􏰏􏰎􏰗􏰂􏰐􏰚􏰟􏰄􏰃􏰉􏰄􏰗􏰗􏰂􏰗􏰢􏰾􏰂􏰤􏰤􏰂􏰚􏰏􏰐􏰠􏰂􏰚􏰦􏱂􏰘􏰈􏰋􏰒􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰋􏰉􏰘􏰈􏰄􏰟􏰂􏰐􏰄􏱃
􏰼􏰏􏰏 􏰐􏰂􏰉􏰄􏱐
􏰽􏰈􏰃􏰘􏰩􏰒 􏰋􏰘 􏰊􏰂􏰗 􏰘􏰈􏰄 􏰙􏰃􏰋􏰉 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰒􏰢 􏰫􏰄􏰙􏰄􏰙􏰛􏰄􏰗 􏰘􏰂 􏰒􏰚􏰛􏰙􏰋􏰘 􏰘􏰈􏰄 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰒 􏰤􏰋􏰘􏰈
p􏰚thon ok –submit
􏰫􏰄􏰌􏰋􏰄􏰤
􏰾􏰂􏰤 􏰤􏰂􏰚􏰏􏰐 􏰠􏰂􏰚 􏰄􏱂􏰎􏰏􏰃􏰋􏰉 􏰘􏰂 􏰃 􏰟􏰏􏰃􏰒􏰒􏰙􏰃􏰘􏰄􏰕
􏰾􏰂􏰤 􏰐􏰂 􏰤􏰄 􏰗􏰄􏰎􏰗􏰄􏰒􏰄􏰉􏰘 􏰉􏰄􏰘􏰤􏰂􏰗􏰅􏰒 􏰃􏰒 􏰍􏰗􏰃􏰎􏰈􏰒􏱃 􏰽􏰈􏰄 􏰒􏰘􏰄􏰎􏰒 􏰂􏰊 􏰘􏰈􏰄 􏰲􏰡􏰑 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏱃
􏰽􏰈􏰄 􏰟􏰂􏰙􏰎􏰚􏰘􏰃􏰘􏰋􏰂􏰉􏰃􏰏 􏰟􏰂􏰙􏰎􏰏􏰄􏱂􏰋􏰘􏰠 􏰂􏰊 􏰲􏰡􏰑􏱃
􏱊􏰂􏰘􏰄􏰢 􏰧􏰊 􏰠􏰂􏰚 􏰐􏰂􏰉􏰩􏰘 􏰐􏰂 􏰘􏰈􏰄 􏰂􏰎􏰘􏰋􏰂􏰉􏰃􏰏 􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒􏰝 􏰠􏰂􏰚 􏰙􏰋􏰍􏰈􏰘 􏰄􏰉􏰟􏰂􏰚􏰉􏰘􏰄􏰗 􏰊􏰃􏰋􏰏􏰋􏰉􏰍 􏰘􏰄􏰒􏰘 􏰟􏰃􏰒􏰄􏰒 􏰤􏰈􏰄􏰉 􏰒􏰚􏰛􏰙􏰋􏰘􏰘􏰋􏰉􏰍 􏰂􏰗 􏰗􏰚􏰉􏰉􏰋􏰉􏰍 p􏰚thon ok 􏰢 􏰼􏰒 􏰏􏰂􏰉􏰍 􏰃􏰒 􏰠􏰂􏰚 􏰎􏰃􏰒􏰒 􏰘􏰈􏰄 􏰘􏰄􏰒􏰘􏰒 􏰊􏰂􏰗 􏰘􏰈􏰄 􏰗􏰄􏰜􏰚􏰋􏰗􏰄􏰐 􏰜􏰚􏰄􏰒􏰘􏰋􏰂􏰉􏰒􏰝 􏰠􏰂􏰚 􏰤􏰋􏰏􏰏 􏰗􏰄􏰟􏰄􏰋􏰌􏰄 􏰟􏰗􏰄􏰐􏰋􏰘 􏰊􏰂􏰗 􏰦􏰉􏰋􏰒􏰈􏰋􏰉􏰍 􏰘􏰈􏰄 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰒􏰢
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
12/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰯􏰎􏰘􏰋􏰂􏰉􏰃􏰏 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰒
􏰨􏰄􏰎􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈
􏰼􏰉􏰂􏰘􏰈􏰄􏰗 􏰚􏰒􏰄􏰊􏰚􏰏 􏰃􏰉􏰐 􏰤􏰋􏰐􏰄􏰏􏰠 􏰃􏰎􏰎􏰏􏰋􏰄􏰐 􏰍􏰗􏰃􏰎􏰈􏰥􏰒􏰄􏰃􏰗􏰟􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰋􏰒 􏰐􏰄􏰎􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰶􏰨􏰡􏰑􏰷􏰢 􏰽􏰈􏰄 􏰋􏰐􏰄􏰃 􏰗􏰄􏰒􏰄􏰙􏰛􏰏􏰄􏰒 􏰘􏰈􏰃􏰘 􏰂􏰊 􏰲􏰡􏰑􏰢 􏰡􏰗􏰂􏰙 􏰃 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰉􏰂􏰐􏰄􏰝 􏰤􏰄 􏰄􏱂􏰎􏰏􏰂􏰗􏰄 􏰃􏰍􏰍􏰗􏰄􏰒􏰒􏰋􏰌􏰄􏰏􏰠 􏰋􏰉 􏰂􏰉􏰄 􏰐􏰋􏰗􏰄􏰟􏰘􏰋􏰂􏰉 􏰚􏰉􏰘􏰋􏰏 􏰤􏰄 􏰟􏰃􏰉􏰉􏰂􏰘 􏰐􏰂 􏰋􏰘 􏰃􏰉􏰠􏰙􏰂􏰗􏰄􏰢 􏰽􏰈􏰄􏰉 􏰤􏰄 􏰘􏰗􏰃􏰟􏰄 􏰛􏰃􏰟􏰅 􏰂􏰚􏰗 􏰒􏰘􏰄􏰎􏰒 􏰚􏰉􏰘􏰋􏰏 􏰤􏰄 􏰟􏰃􏰉 􏰄􏱂􏰎􏰏􏰂􏰗􏰄 􏰒􏰂􏰙􏰄􏰘􏰈􏰋􏰉􏰍 􏰉􏰄􏰤􏰝 􏰃􏰉􏰐 􏰗􏰄􏰎􏰄􏰃􏰘􏰢 􏰣􏰄 􏰟􏰃􏰉 􏰘􏰈􏰋􏰉􏰅 􏰂􏰊 􏰘􏰈􏰋􏰒 􏰃􏰒 􏰘􏰈􏰄 􏰃􏰎􏰎􏰗􏰂􏰃􏰟􏰈 􏰂􏰊 􏰄􏱂􏰎􏰏􏰂􏰗􏰋􏰉􏰍 􏰃 􏰙􏰃􏰿􏰄 􏰥 􏰙􏰚􏰟􏰈 􏰏􏰋􏰅􏰄 􏰋􏰉 􏰘􏰈􏰄 􏰒􏰘􏰂􏰗􏰠 􏰂􏰊 􏰽􏰈􏰄􏰒􏰄􏰚􏰒 􏰃􏰉􏰐 􏰘􏰈􏰄 􏰸􏰋􏰉􏰂􏰘􏰃􏰚􏰗 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰄􏰉􏰢􏰤􏰋􏰅􏰋􏰎􏰄􏰐􏰋􏰃􏰢􏰂􏰗􏰍􏰳􏰤􏰋􏰅􏰋􏰳􏰽􏰈􏰄􏰒􏰄􏰚􏰒􏱑􏰽􏰈􏰄􏰻􏰙􏰠􏰘􏰈􏰻􏰂􏰊􏰻􏰽􏰈􏰄􏰒􏰄􏰚􏰒􏰻􏰃􏰉􏰐􏰻􏰘􏰈􏰄􏰻􏰸􏰋􏰉􏰂􏰘􏰃􏰚􏰗􏰷􏰢
􏱄􏰂􏰚􏰗 􏰘􏰃􏰒􏰅 􏰋􏰒 􏰘􏰂 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰘􏰈􏰋􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰋􏰉 􏰪􏰠􏰘􏰈􏰂􏰉􏰝 􏰃􏰒 􏰎􏰄􏰗 􏰘􏰈􏰄 􏰗􏰄􏰟􏰋􏰎􏰄 􏰛􏰄􏰏􏰂􏰤􏰢 􏰽􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰋􏰘􏰒􏰄􏰏􏰊 􏰋􏰒 􏰌􏰄􏰗􏰠 􏰒􏰋􏰙􏰋􏰏􏰃􏰗 􏰘􏰂 􏰲􏰡􏰑􏰢 􏰽􏰈􏰄 􏰙􏰃􏰋􏰉 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰟􏰄 􏰋􏰒 􏰘􏰈􏰃􏰘 􏰋􏰉 􏰲􏰡􏰑 􏰤􏰄 􏰤􏰄􏰗􏰄 􏰚􏰒􏰋􏰉􏰍 􏰃 􏰜􏰚􏰄􏰚􏰄􏰕 􏰃 􏰦􏰗􏰒􏰘􏰥􏰋􏰉 􏰦􏰗􏰒􏰘􏰥􏰂􏰚􏰘 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰢 􏰽􏰈􏰋􏰒 􏰃􏰏􏰏􏰂􏰤􏰄􏰐 􏰚􏰒 􏰘􏰂 􏰄􏱂􏰎􏰏􏰂􏰗􏰄 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰋􏰉 􏰏􏰃􏰠􏰄􏰗􏰒􏰢 􏰣􏰋􏰘􏰈 􏰨􏰡􏰑􏰝 􏰤􏰄 􏰤􏰃􏰉􏰘 􏰘􏰂 􏰄􏱂􏰎􏰏􏰂􏰗􏰄 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰐􏰄􏰎􏰘􏰈􏰒 􏰃􏰍􏰍􏰗􏰄􏰒􏰒􏰋􏰌􏰄􏰏􏰠􏰝 􏰒􏰂 􏰋􏰉􏰒􏰘􏰄􏰃􏰐 􏰤􏰄 􏰉􏰄􏰄􏰐 􏰃 􏰦􏰗􏰒􏰘􏰥􏰋􏰉 􏰏􏰃􏰒􏰘􏰥􏰂􏰚􏰘 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰢 􏰽􏰈􏰄 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄 􏰒􏰚􏰋􏰘􏰃􏰛􏰏􏰄 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰋􏰒 􏰟􏰃􏰏􏰏􏰄􏰐 􏰃 􏰒􏰘ack􏰝 􏰛􏰚􏰘 􏰋􏰘 􏰟􏰃􏰉 􏰛􏰄 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰄􏰐 􏰟􏰂􏰉􏰌􏰄􏰉􏰋􏰄􏰉􏰘􏰏􏰠 􏰋􏰉 􏰪􏰠􏰘􏰈􏰂􏰉 􏰚􏰒􏰋􏰉􏰍 􏰃 􏰏􏰋􏰒􏰘 􏰤􏰋􏰘􏰈􏰂􏰚􏰘 􏰏􏰂􏰒􏰒 􏰂􏰊 􏰄􏰞􏰟􏰋􏰄􏰉􏰟􏰠􏰢 􏰣􏰄􏰩􏰏􏰏 􏰚􏰒􏰄 􏰏􏰋􏰒􏰘 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒 􏰘􏰂 􏰃􏰎􏰎􏰄􏰉􏰐 􏰃􏰉􏰐 􏰎􏰂􏰎 􏰋􏰉 􏰘􏰈􏰄 􏰄􏰉􏰐 􏰂􏰊 􏰘􏰈􏰄 􏰏􏰋􏰒􏰘 􏰃􏰒 􏰃􏰎􏰎􏰗􏰂􏰎􏰗􏰋􏰃􏰘􏰄􏰢
􏰼􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰶􏰨􏰡􏰑􏰷􏰕
􏰪􏰋􏰟􏰅 􏰃 􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰉􏰂􏰐􏰄 􏰧􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄 􏰃􏰉 􏰄􏰙􏰎􏰘􏰠 􏰏􏰋􏰒􏰘 􏰣􏰈􏰋􏰏􏰄 􏰋􏰒 􏰉􏰂􏰘 􏰄􏰙􏰎􏰘􏰠􏰕
􏰪􏰂􏰎 􏰏􏰃􏰒􏰘 􏰋􏰘􏰄􏰙 􏰂􏰊
􏰡􏰂􏰗 􏰄􏰃􏰟􏰈 􏰄􏰐􏰍􏰄 􏰕 􏰋􏰊 􏰚􏰉􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐􏰕
􏰸􏰃􏰗􏰅 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰼􏰎􏰎􏰄􏰉􏰐 􏰘􏰂 􏰄􏰉􏰐 􏰂􏰊
􏱊􏰂􏰘􏰋􏰟􏰄 􏰈􏰂􏰤 􏰟􏰏􏰂􏰒􏰄􏰏􏰠 􏰘􏰈􏰋􏰒 􏰗􏰄􏰒􏰄􏰙􏰛􏰏􏰄􏰒 􏰘􏰂 􏰲􏰡􏰑􏰢 􏰣􏰈􏰄􏰉 􏰠􏰂􏰚 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰝 􏰠􏰂􏰚􏰩􏰗􏰄 􏰃􏰏􏰒􏰂 􏰃􏰒􏰅􏰄􏰐 􏰘􏰂 􏰅􏰄􏰄􏰎 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 􏰘􏰤􏰂 􏰘􏰈􏰋􏰉􏰍􏰒 􏰚􏰒􏰋􏰉􏰍 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰋􏰄􏰒􏰕 􏰘􏰈􏰄 􏰎􏰗􏰄􏰌􏰋􏰂􏰚􏰒 􏰉􏰂􏰐􏰄 􏰤􏰈􏰄􏰗􏰄 􏰄􏰃􏰟􏰈 􏰉􏰂􏰐􏰄 􏰤􏰃􏰒 􏰗􏰄􏰃􏰟􏰈􏰄􏰐􏰝 􏰃􏰉􏰐 􏰘􏰈􏰄 􏰂􏰗􏰐􏰄􏰗 􏰋􏰉 􏰤􏰈􏰋􏰟􏰈 􏰘􏰈􏰄􏰠 􏰤􏰄􏰗􏰄 􏰎􏰂􏰎􏰎􏰄􏰐 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰏􏰋􏰒􏰘􏰢 􏰽􏰈􏰄􏰒􏰄 􏰃􏰏􏰏􏰂􏰤 􏰠􏰂􏰚 􏰘􏰂 􏰒􏰄􏰄 􏰘􏰈􏰄 􏰂􏰗􏰐􏰄􏰗 􏰋􏰉 􏰤􏰈􏰋􏰟􏰈 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰍􏰂􏰄􏰒 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒􏰝 􏰃􏰉􏰐 􏰟􏰂􏰙􏰎􏰃􏰗􏰄 􏰘􏰂 􏰲􏰡􏰑􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏰔
􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄􏰘􏰈􏰄􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 dfs 􏰋􏰉􏰘􏰈􏰄􏰦􏰏􏰄 ses07_e􏰘tra.p􏰚􏰢􏱄􏰂􏰚􏰟􏰃􏰉􏰘􏰄􏰒􏰘􏰠􏰂􏰚􏰗􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰤􏰋􏰘􏰈
p􏰚thon ok -q dfs
􏱊􏰂􏰘􏰄 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰘􏰄􏰒􏰘 􏰍􏰗􏰃􏰎􏰈 􏰊􏰂􏰗 􏰨􏰡􏰑 􏰋􏰒 􏰒􏰏􏰋􏰍􏰈􏰘􏰏􏰠 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰂􏰉􏰄 􏰤􏰄 􏰚􏰒􏰄􏰐 􏰋􏰉 􏰘􏰈􏰄 􏰟􏰏􏰃􏰒􏰒􏰢
􏱊􏰂􏰘􏰋􏰟􏰄 􏰃􏰏􏰒􏰂 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰘􏰄􏰒􏰘􏰒 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄 􏰃􏰗􏰄 􏰉􏰂􏰘 􏰌􏰄􏰗􏰠 􏰟􏰂􏰙􏰎􏰗􏰄􏰈􏰄􏰉􏰒􏰋􏰌􏰄􏰢 􏰽􏰈􏰋􏰒 􏰋􏰒 􏰛􏰄􏰟􏰃􏰚􏰒􏰄 􏰤􏰄􏰩􏰗􏰄 􏰚􏰒􏰋􏰉􏰍 􏰚􏰉􏰂􏰗􏰐􏰄􏰗􏰄􏰐 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰒 􏰶􏰒􏰄􏰘􏰒􏰝 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰋􏰄􏰒􏰷 􏰃􏰉􏰐 􏰘􏰈􏰄􏰗􏰄􏰊􏰂􏰗􏰄 􏰘􏰈􏰄 􏰄􏱂􏰃􏰟􏰘 􏰒􏰄􏰃􏰗􏰟􏰈 􏰂􏰗􏰐􏰄􏰗 􏰂􏰊 􏰠􏰂􏰚􏰗 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰙􏰃􏰠 􏰉􏰂􏰘 􏰛􏰄 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰂􏰉 􏰃􏰏􏰏 􏰟􏰂􏰙􏰎􏰚􏰘􏰄􏰗􏰒􏰢 􏰧􏰊 􏰠􏰂􏰚􏰩􏰐 􏰏􏰋􏰅􏰄 􏰘􏰂 􏰍􏰄􏰘 􏰙􏰂􏰗􏰄 􏰊􏰄􏰄􏰐􏰛􏰃􏰟􏰅 􏰂􏰉 􏰠􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰝 􏰃􏰒􏰅 􏰃 􏰘􏰚􏰘􏰂􏰗 􏰘􏰂 􏰏􏰂􏰂􏰅 􏰃􏰘 􏰠􏰂􏰚􏰗 􏰟􏰂􏰐􏰄 􏰃􏰉􏰐 􏰗􏰄􏰒􏰚􏰏􏰘􏰒􏰢
􏱋􏰒􏰄 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰘􏰂 􏰒􏰄􏰃􏰗􏰟􏰈 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰘􏰈􏰄 􏰄􏱂􏰃􏰙􏰎􏰏􏰄 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰟􏰏􏰃􏰒􏰒􏰢 􏰾􏰂􏰤 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘 􏰋􏰒 􏰘􏰈􏰄 􏰨􏰡􏰑 􏰃􏰎􏰎􏰗􏰂􏰃􏰟􏰈 􏰊􏰗􏰂􏰙 􏰲􏰡􏰑 􏰋􏰉 􏰘􏰈􏰋􏰒 􏰟􏰃􏰒􏰄􏱃
􏰣􏰄 􏰚􏰒􏰄􏰐 􏰲􏰡􏰑 􏰘􏰂 􏰦􏰉􏰐 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰎􏰃􏰘􏰈􏰒 􏰋􏰉 􏰃 􏰍􏰗􏰃􏰎􏰈 􏰥 􏰋􏰒 􏰨􏰡􏰑 􏰃􏰒 􏰍􏰂􏰂􏰐 􏰊􏰂􏰗 􏰘􏰈􏰋􏰒 􏰎􏰚􏰗􏰎􏰂􏰒􏰄􏱃 􏰑􏰄􏰃􏰗􏰟􏰈 􏰂􏰉􏰏􏰋􏰉􏰄 􏰊􏰂􏰗 􏰟􏰂􏰙􏰎􏰃􏰗􏰋􏰒􏰂􏰉􏰒 􏰂􏰉 􏰤􏰈􏰃􏰘 􏰅􏰋􏰉􏰐􏰒 􏰂􏰊 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰒 􏰠􏰂􏰚 􏰤􏰂􏰚􏰏􏰐 􏰗􏰃􏰘􏰈􏰄􏰗 􏰒􏰂􏰏􏰌􏰄 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰘􏰤􏰂 􏰍􏰗􏰃􏰎􏰈 􏰒􏰄􏰃􏰗􏰟􏰈 􏰃􏰎􏰎􏰗􏰂􏰃􏰟􏰈􏰄􏰒􏰢
􏰃􏰉􏰐 􏰋􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄 􏰒􏰄􏰘 􏰂􏰊 􏰄􏱂􏰎􏰏􏰂􏰗􏰄􏰐 􏰉􏰂􏰐􏰄􏰒 􏰃􏰒 􏰄􏰙􏰎􏰘􏰠 􏰛􏰚􏰘 􏰊􏰂􏰗 􏰂􏰊 􏰗􏰄􏰃􏰟􏰈􏰃􏰛􏰏􏰄 􏰉􏰂􏰐􏰄􏰒􏰝 􏰃􏰎􏰎􏰄􏰉􏰐 􏰘􏰂 􏰏􏰋􏰒􏰘
􏰃􏰒 􏰟􏰚􏰗􏰗􏰄􏰉􏰘 􏰉􏰂􏰐􏰄
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
13/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰖􏰗􏰃􏰎􏰈􏰒􏰝 􏰘􏰈􏰄 􏰄􏰃􏰒􏰠 􏰤􏰃􏰠
􏰣􏰈􏰄􏰉 􏰤􏰂􏰗􏰅􏰋􏰉􏰍 􏰂􏰉 􏰍􏰗􏰃􏰎􏰈 􏰎􏰗􏰂􏰛􏰏􏰄􏰙􏰒 􏰋􏰉 􏰎􏰗􏰃􏰟􏰘􏰋􏰟􏰄􏰝 􏰤􏰄 􏰟􏰃􏰉 􏰚􏰒􏰚􏰃􏰏􏰏􏰠 􏰃􏰎􏰎􏰏􏰠 􏰗􏰄􏰃􏰐􏰠􏰙􏰃􏰐􏰄 􏰪􏰠􏰘􏰈􏰂􏰉 􏰏􏰋􏰛􏰗􏰃􏰗􏰋􏰄􏰒􏰢 􏰽􏰂􏰐􏰃􏰠 􏰤􏰄􏰩􏰏􏰏 􏰚􏰒􏰄􏰘􏰈􏰄􏰎􏰂􏰎􏰚􏰏􏰃􏰗 network􏰘 􏰏􏰋􏰛􏰗􏰃􏰗􏰠􏰘􏰂􏰒􏰘􏰚􏰐􏰠􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒􏰂􏰉􏰃􏱍􏰂􏰉􏰐􏰂􏰉􏱋􏰉􏰐􏰄􏰗􏰍􏰗􏰂􏰚􏰉􏰐􏰐􏰃􏰘􏰃􏰒􏰄􏰘􏰢
􏰽􏰈􏰄􏰪􏰠􏰘􏰈􏰂􏰉􏰦􏰏􏰄 ses07_weighted_e􏰘tra.p􏰚 􏰟􏰂􏰉􏰘􏰃􏰋􏰉􏰒􏰒􏰃􏰙􏰎􏰏􏰄􏰟􏰂􏰐􏰄􏰊􏰂􏰗􏰚􏰒􏰋􏰉􏰍􏰘􏰈􏰄 network􏰘 􏰏􏰋􏰛􏰗􏰃􏰗􏰠􏰢
􏰣􏰄 􏰦􏰗􏰒􏰘 􏰋􏰙􏰎􏰂􏰗􏰘 􏰘􏰈􏰄 􏰏􏰋􏰛􏰗􏰃􏰗􏰠 􏰃􏰉􏰐 􏰗􏰄􏰃􏰐 􏰘􏰈􏰄 􏰏􏰄􏰟􏰘􏰚􏰗􏰄 􏰉􏰄􏰘􏰤􏰂􏰗􏰅 􏰋􏰉􏰘􏰂 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄 􏰘􏰈􏰃􏰘 􏰉􏰄􏰘􏰤􏰂􏰗􏰅􏱂 􏰚􏰒􏰄􏰒􏰢 􏰣􏰋􏰘􏰈 􏰘􏰈􏰄 􏰍􏰗􏰃􏰎􏰈 􏰃􏰘 􏰈􏰃􏰉􏰐􏰝 􏰤􏰄 􏰟􏰃􏰉 􏰟􏰃􏰏􏰟􏰚􏰏􏰃􏰘􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰃􏰉􏰐 􏰎􏰃􏰘􏰈􏰒 􏰤􏰋􏰘􏰈 􏰃 􏰒􏰋􏰉􏰍􏰏􏰄 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰢
􏰽􏰈􏰄􏰊􏰂􏰏􏰐􏰄􏰗􏰃􏰏􏰒􏰂􏰟􏰂􏰉􏰘􏰃􏰋􏰉􏰒􏰘􏰈􏰄􏱀􏱂􏰟􏰄􏰏􏰦􏰏􏰄 tube_data.􏰘ls􏰢􏰧􏰘􏰟􏰂􏰉􏰘􏰃􏰋􏰉􏰒􏱍􏰂􏰉􏰐􏰂􏰉􏱋􏰉􏰐􏰄􏰗􏰍􏰗􏰂􏰚􏰉􏰐􏰉􏰄􏰘􏰤􏰂􏰗􏰅 􏰋􏰉􏰘􏰄􏰗􏰒􏰘􏰃􏰘􏰋􏰂􏰉 􏰘􏰗􏰃􏰌􏰄􏰏 􏰘􏰋􏰙􏰄􏰒 􏰊􏰂􏰗 􏰘􏰈􏰄 􏰉􏰄􏰘􏰤􏰂􏰗􏰅 􏰃􏰒 􏰋􏰘 􏰄􏱂􏰋􏰒􏰘􏰄􏰐 􏰃􏰛􏰂􏰚􏰘 􏰃 􏰐􏰄􏰟􏰃􏰐􏰄 􏰃􏰍􏰂􏰢 􏰣􏰄 􏰟􏰃􏰉 􏰗􏰄􏰃􏰐 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃 􏰋􏰉􏰘􏰂 􏰪􏰠􏰘􏰈􏰂􏰉 􏰚􏰒􏰋􏰉􏰍 􏰎􏰃􏰉􏰐􏰃􏰒􏰢 􏰶􏰣􏰄􏰩􏰏􏰏 􏰗􏰄􏰘􏰚􏰗􏰉 􏰘􏰂 􏰎􏰃􏰉􏰐􏰃􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰏􏰃􏰒􏰘 􏰒􏰄􏰒􏰒􏰋􏰂􏰉􏰢􏰷
i􏰋􏰏􏰅􏰉􏰎 􏰆e􏰎􏰒􏰅􏰉k􏰘 a􏰂 􏰆􏰘
G = create_lecture_graph_network􏰘()
shortest_dists = n􏰘.single_source_dijkstra_path_length(G, ‘A’)
all_shortest_dists = n􏰘.all_pairs_dijkstra_path_length(G)
# Read London 􏰜ndergro􏰜nd da􏰎a.
i􏰋􏰏􏰅􏰉􏰎 􏰏a􏰆da􏰂 a􏰂 􏰏d
tube_data = pd.read_e􏰘cel(‘tube_data.􏰘ls’, sheetname=’Runtime’)
tube_data.describe()
􏰨􏰋􏰒􏰘􏰃􏰉􏰟􏰄 􏰶􏰰􏰙􏰒􏰷
􏰟􏰂􏰚􏰉􏰘 􏰔􏱈􏰵􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰙􏰄􏰃􏰉 􏰭􏰢􏰵􏰭􏰵􏰮􏰵􏰴
􏰒􏰘􏰐 􏰭􏰢􏰴􏰮􏱒􏰵􏱇􏰭
􏰙􏰋􏰉 􏰴􏰢􏰮􏱆􏰴􏰴􏰴􏰴
􏰮􏱆􏰺 􏰴􏰢􏰔􏱈􏱆􏰴􏰴􏰴
􏱆􏰴􏰺 􏰭􏰢􏰴􏱇􏰴􏰴􏰴􏰴
􏰔􏱆􏰺 􏰭􏰢􏱆􏱒􏰴􏰴􏰴􏰴
􏰙􏰃􏱂 􏰭􏰭􏰢􏱇􏰵􏰴􏰴􏰴􏰴
􏱋􏰉􏰥􏰋􏰙􏰎􏰄􏰐􏰄􏰐 􏰫􏰚􏰉􏰉􏰋􏰉􏰍 􏰽􏰋􏰙􏰄 􏰶􏰸􏰋􏰉􏰒􏰷
􏰔􏱈􏰵􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰮􏰢􏰴􏱆􏰮􏱇􏱈􏰔 􏰭􏰢􏰴􏱈􏱉􏱒􏰔􏰭 􏰴􏰢􏰔􏱇􏱇􏱇􏱇􏰔 􏰭􏰢􏱈􏱉􏰵􏰵􏰵􏰵 􏰭􏰢􏱉􏱆􏰴􏰴􏰴􏰴 􏰮􏰢􏰮􏱉􏰵􏰵􏰵􏰵 􏰭􏰭􏰢􏰴􏰭􏱇􏱇􏱇􏰔
􏰼􏰸 􏰎􏰄􏰃􏰅 􏰶􏰴􏰔􏰴􏰴􏰥􏰭􏰴􏰴􏰴􏰷 􏰫􏰚􏰉􏰉􏰋􏰉􏰍 􏰽􏰋􏰙􏰄 􏰶􏰸􏰋􏰉􏰒􏰷
􏰔􏱈􏰵􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰮􏰢􏱈􏱈􏰮􏰭􏰴􏱆 􏰭􏰢􏰭􏰭􏰔􏱈􏱉􏰭 􏰭􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰭􏰢􏱒􏱆􏱈􏰴􏰭􏰔 􏰮􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰮􏰢􏱉􏱇􏱆􏰭􏱆􏰭 􏰭􏰭􏰢􏱆􏰴􏰴􏰴􏰴􏰴
􏰧􏰉􏰘􏰄􏰗 􏰎􏰄􏰃􏰅 􏰶􏰭􏰴􏰴􏰴 􏰥 􏰭􏱇􏰴􏰴􏰷 􏰫􏰚􏰉􏰉􏰋􏰉􏰍 􏰘􏰋􏰙􏰄 􏰶􏰙􏰋􏰉􏰒􏰷
􏰔􏱈􏰵􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰮􏰢􏰵􏱒􏱈􏰴􏰴􏱉 􏰭􏰢􏰭􏰴􏰮􏱆􏰭􏱇 􏰭􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰭􏰢􏰔􏱆􏰴􏰴􏰴􏰴 􏰮􏰢􏰴􏰴􏰴􏰴􏰴􏰴 􏰮􏰢􏰔􏱆􏰴􏰴􏰴􏰴 􏰭􏰭􏰢􏱆􏰴􏰴􏰴􏰴􏰴
􏰽􏰈􏰄 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰃􏰗􏰄 􏰎􏰗􏰂􏰌􏰋􏰐􏰄􏰐 􏰃􏰒 􏰛􏰂􏰘􏰈 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰃􏰉􏰐 􏰘􏰗􏰃􏰌􏰄􏰏 􏰘􏰋􏰙􏰄􏰒􏰢 􏱍􏰄􏰘􏰩􏰒 􏰗􏰄􏰃􏰐 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃 􏰋􏰉􏰘􏰂 􏰃 􏰍􏰗􏰃􏰎􏰈􏰢
G=n􏰘.Graph()
f􏰅􏰉 inde􏰘, item i􏰆 tube_data.iterrows():
G.add_edge(item[‘Station from (A)’], item[‘Station to (B)’], weight=item[‘AM
peak (0700-1000) Running Time (Mins)’])
# Ge􏰎 all edges 􏰒i􏰎h 􏰒eigh􏰎s
all_edges = G.edges(data=T􏰉􏰜e)
􏰡􏰋􏰉􏰃􏰏􏰏􏰠􏰝 􏰏􏰄􏰘􏰩􏰒 􏰟􏰃􏰏􏰟􏰚􏰏􏰃􏰘􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒􏰢
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
14/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
all_shortest_dists = n􏰘.all_pairs_dijkstra_path_length(G)
all_shortest_paths = n􏰘.all_pairs_dijkstra_path(G)
all_shortest_dists_dict = dict(all_shortest_dists)
all_shortest_paths_dict = dict(all_shortest_paths)
all_shortest_dists_dict[‘SOUTH KENSINGTON’][‘LIVERPOOL STREET’]
all_shortest_paths_dict[‘SOUTH KENSINGTON’][‘LIVERPOOL STREET’]
􏰧􏰉􏰒􏰎􏰄􏰟􏰘 􏰘􏰈􏰄 􏰗􏰄􏰒􏰚􏰏􏰘􏰒 􏰃􏰉􏰐 􏰟􏰂􏰙􏰎􏰃􏰗􏰄 􏰘􏰈􏰄􏰙 􏰘􏰂 􏰘􏰈􏰄 􏰽􏰚􏰛􏰄 􏰙􏰃􏰎 􏰶􏰈􏰘􏰘􏰎􏰕􏰳􏰳􏰟􏰂􏰉􏰘􏰄􏰉􏰘􏰢􏰘􏱓􏰢􏰍􏰂􏰌􏰢􏰚􏰅􏰳􏰒􏰘􏰃􏰉􏰐􏰃􏰗􏰐􏰥􏰘􏰚􏰛􏰄􏰥􏰙􏰃􏰎􏰢􏰎􏰐􏰊􏰷􏰢 􏰽􏰈􏰄􏰗􏰄 􏰋􏰒 􏰒􏰂􏰙􏰄􏰘􏰈􏰋􏰉􏰍 􏰊􏰚􏰉􏰉􏰠 􏰍􏰂􏰋􏰉􏰍 􏰂􏰉􏰢􏰢􏰢 􏰣􏰈􏰃􏰘 􏰃􏰗􏰄 􏰤􏰄 􏰙􏰋􏰒􏰒􏰋􏰉􏰍 􏰋􏰉 􏰘􏰈􏰄 􏰐􏰃􏰘􏰃􏱃
􏰼􏰐􏰌􏰃􏰉􏰟􏰄􏰐􏰢 􏰽􏰈􏰄􏰗􏰄 􏰃􏰗􏰄 􏰙􏰃􏰉􏰠 􏰂􏰘􏰈􏰄􏰗 􏰍􏰗􏰄􏰃􏰘 􏰪􏰠􏰘􏰈􏰂􏰉 􏰏􏰋􏰛􏰗􏰃􏰗􏰋􏰄􏰒 􏰊􏰂􏰗 􏰐􏰄􏰃􏰏􏰋􏰉􏰍 􏰤􏰋􏰘􏰈 􏰉􏰄􏰘􏰤􏰂􏰗􏰅 􏰃􏰉􏰐 􏰍􏰗􏰃􏰎􏰈 􏰐􏰃􏰘􏰃􏰢􏰡􏰂􏰗􏰄􏱂􏰃􏰙􏰎􏰏􏰄􏰝􏰘􏰈􏰄 osmn􏰘 􏰶􏰈􏰘􏰘􏰎􏰕􏰳􏰳􏰍􏰄􏰂􏱌􏰛􏰂􏰄􏰋􏰉􏰍􏰢􏰟􏰂􏰙􏰳􏰮􏰴􏰭􏱇􏰳􏰭􏰭􏰳􏰂􏰒􏰙􏰉􏱂􏰥􏰎􏰠􏰘􏰈􏰂􏰉􏰥􏰒􏰘􏰗􏰄􏰄􏰘􏰥 􏰉􏰄􏰘􏰤􏰂􏰗􏰅􏰒􏰳􏰷􏰏􏰋􏰛􏰗􏰃􏰗􏰠􏰛􏰚􏰋􏰏􏰐􏰒􏰂􏰉 network􏰘 􏰘􏰂􏰟􏰂􏰙􏰛􏰋􏰉􏰄􏰋􏰘􏰒􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒􏰤􏰋􏰘􏰈􏰙􏰃􏰎􏰐􏰃􏰘􏰃􏰊􏰗􏰂􏰙􏰘􏰈􏰄 􏰯􏰎􏰄􏰉􏰑􏰘􏰗􏰄􏰄􏰘􏰸􏰃􏰎 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰤􏰤􏰤􏰢􏰂􏰎􏰄􏰉􏰒􏰘􏰗􏰄􏰄􏰘􏰙􏰃􏰎􏰢􏰂􏰗􏰍􏰳􏰷 􏰒􏰄􏰗􏰌􏰋􏰟􏰄􏰢
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
15/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰤􏰋􏰘􏰈 􏰃 􏰈􏰄􏰃􏰎
􏰣􏰄 􏰟􏰃􏰉 􏰐􏰗􏰃􏰙􏰃􏰘􏰋􏰟􏰃􏰏􏰏􏰠 􏰋􏰙􏰎􏰗􏰂􏰌􏰄 􏰘􏰈􏰄 􏰒􏰎􏰄􏰄􏰐 􏰂􏰊 􏰂􏰚􏰗 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰂􏰊 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰚􏰒􏰋􏰉􏰍 􏰃 􏰒􏰎􏰄􏰟􏰋􏰦􏰟 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰕 􏰃 􏰈􏰄􏰃􏰎 􏰶􏰂􏰗 􏰃 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠 􏰜􏰚􏰄􏰚􏰄􏰷􏰢 􏰽􏰈􏰄 􏰈􏰄􏰃􏰎 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄􏰩􏰒 􏰟􏰂􏰗􏰄 􏰒􏰘􏰗􏰄􏰉􏰍􏰘􏰈 􏰋􏰒 􏰋􏰘􏰒 􏰊􏰃􏰒􏰘 􏰙􏰄􏰃􏰉􏰒 􏰊􏰂􏰗 􏰦􏰉􏰐 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙 􏰌􏰃􏰏􏰚􏰄 􏰤􏰋􏰘􏰈􏰋􏰉 􏰋􏰘􏰢 􏰽􏰈􏰋􏰒 􏰟􏰃􏰉 􏰛􏰄 􏰐􏰂􏰉􏰄 􏰋􏰉 􏰝 􏰤􏰈􏰋􏰏􏰄 􏰊􏰂􏰗 􏰃 􏰏􏰋􏰒􏰘 􏰘􏰈􏰋􏰒 􏰤􏰂􏰚􏰏􏰐 􏰘􏰃􏰅􏰄 􏰏􏰋􏰉􏰄􏰃􏰗 􏰘􏰋􏰙􏰄􏰢 􏰼 􏰈􏰄􏰃􏰎 􏰃􏰏􏰒􏰂 􏰃􏰏􏰏􏰂􏰤􏰒 􏰋􏰘􏰄􏰙 􏰐􏰄􏰏􏰄􏰘􏰋􏰂􏰉 􏰃􏰉􏰐 􏰋􏰉􏰒􏰄􏰗􏰘􏰋􏰂􏰉 􏰋􏰉 􏰘􏰋􏰙􏰄􏰢
􏰬􏰂􏰉􏰌􏰄􏰉􏰋􏰄􏰉􏰘􏰏􏰠􏰝 􏰘􏰈􏰄􏰒􏰄 􏰃􏰗􏰄 􏰎􏰗􏰄􏰟􏰋􏰒􏰄􏰏􏰠 􏰘􏰈􏰄 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒 􏰤􏰄 􏰗􏰄􏰎􏰄􏰃􏰘􏰄􏰐􏰏􏰠 􏰉􏰄􏰄􏰐 􏰋􏰉 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏰣􏰄􏰩􏰐 􏰏􏰋􏰅􏰄 􏰘􏰂 􏰈􏰂􏰏􏰐 􏰘􏰈􏰄 􏰄􏰐􏰍􏰄􏰒 􏰟􏰂􏰉􏰉􏰄􏰟􏰘􏰋􏰉􏰍 􏰃􏰉􏰐 􏰋􏰉 􏰃 􏱎􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠 􏰜􏰚􏰄􏰚􏰄􏱎 􏰤􏰈􏰄􏰗􏰄 􏰘􏰈􏰄􏰠 􏰃􏰗􏰄 􏰂􏰗􏰐􏰄􏰗􏰄􏰐 􏰉􏰂􏰘 􏰛􏰠 􏰤􏰈􏰄􏰉 􏰘􏰈􏰄􏰠 􏰄􏰉􏰘􏰄􏰗 􏰘􏰈􏰄 􏰜􏰚􏰄􏰚􏰄 􏰃􏰒 􏰋􏰉 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈􏰝 􏰛􏰚􏰘 􏰛􏰠 􏰘􏰈􏰄􏰋􏰗 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄􏰢 􏰽􏰈􏰄􏰉 􏰤􏰄 􏰟􏰂􏰚􏰏􏰐 􏰒􏰋􏰙􏰎􏰏􏰠 􏰎􏰋􏰟􏰅 􏰘􏰈􏰄 􏰛􏰄􏰒􏰘 􏰄􏰐􏰍􏰄 􏰋􏰉 􏰄􏰌􏰄􏰗􏰠 􏰋􏰘􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰢 􏰽􏰈􏰄 􏰎􏰗􏰂􏰛􏰏􏰄􏰙 􏰋􏰒 􏰘􏰈􏰃􏰘 􏰤􏰄 􏰉􏰄􏰄􏰐 􏰘􏰂 􏰅􏰄􏰄􏰎 􏰘􏰈􏰄 􏰜􏰚􏰄􏰚􏰄 􏰋􏰉 􏰂􏰗􏰐􏰄􏰗 􏰤􏰈􏰄􏰉 􏰚􏰎􏰐􏰃􏰘􏰋􏰉􏰍 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄􏰒􏰢 􏰽􏰈􏰋􏰒 􏰋􏰒 􏰤􏰈􏰄􏰗􏰄 􏰃 􏰈􏰄􏰃􏰎 􏰛􏰄􏰟􏰂􏰙􏰄􏰒 􏰚􏰒􏰄􏰊􏰚􏰏􏰕 􏰛􏰠 􏰌􏰋􏰗􏰘􏰚􏰄 􏰂􏰊 􏰏􏰂􏰍􏰃􏰗􏰋􏰘􏰈􏰙􏰋􏰟􏰥􏰘􏰋􏰙􏰄 􏰈􏰄􏰃􏰎 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒􏰝 􏰤􏰄 􏰟􏰃􏰉 􏰙􏰃􏰉􏰃􏰍􏰄 􏰘􏰈􏰋􏰒 􏰋􏰉
􏰢
􏰧􏰘 􏰋􏰒 􏰚􏰒􏰄􏰊􏰚􏰏 􏰘􏰃􏰅􏰄 􏰃 􏰙􏰂􏰙􏰄􏰉􏰘 􏰘􏰂 􏰟􏰂􏰙􏰎􏰃􏰗􏰄 􏰘􏰈􏰋􏰒 􏰃􏰎􏰎􏰗􏰂􏰃􏰟􏰈 􏰘􏰂 􏰛􏰗􏰄􏰃􏰐􏰘􏰈􏰥􏰦􏰗􏰒􏰘 􏰒􏰄􏰃􏰗􏰟􏰈􏰢 􏰧􏰉 􏰛􏰂􏰘􏰈 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒􏰝 􏰤􏰄 􏰏􏰂􏰂􏰎 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰅􏰄􏰄􏰎 􏰃 􏰜􏰚􏰄􏰚􏰄 􏰂􏰊 􏰤􏰈􏰋􏰟􏰈 􏰉􏰂􏰐􏰄 􏰘􏰂 􏰌􏰋􏰒􏰋􏰘 􏰉􏰄􏱂􏰘􏰢 􏰧􏰉 􏰲􏰡􏰑􏰝 􏰤􏰋􏰘􏰈 􏰉􏰂 􏰄􏰐􏰍􏰄 􏰤􏰄􏰋􏰍􏰈􏰘􏰒􏰝 􏰤􏰄 􏰈􏰃􏰐 􏰃 􏰒􏰋􏰙􏰎􏰏􏰄 􏰜􏰚􏰄􏰚􏰄 􏰂􏰊 􏰉􏰂􏰐􏰄􏰒 􏰃􏰉􏰐 􏰐􏰋􏰐􏰉􏰩􏰘 􏰉􏰄􏰄􏰐 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰋􏰄􏰒􏰢 􏰧􏰉 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰝 􏰘􏰂 􏰃􏰟􏰟􏰂􏰚􏰉􏰘 􏰊􏰂􏰗 􏰤􏰄􏰋􏰍􏰈􏰘􏰒􏰝 􏰤􏰄 􏰅􏰄􏰄􏰎 􏰃 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠 􏰜􏰚􏰄􏰚􏰄 􏰘􏰂 􏰌􏰋􏰒􏰋􏰘 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒 􏰋􏰉 􏰘􏰈􏰄 􏰟􏰂􏰗􏰗􏰄􏰟􏰘 􏰂􏰗􏰐􏰄􏰗􏰢 􏰽􏰈􏰄 􏰈􏰄􏰃􏰎 􏰐􏰃􏰘􏰃 􏰒􏰘􏰗􏰚􏰟􏰘􏰚􏰗􏰄 􏰃􏰏􏰏􏰂􏰤􏰒 􏰎􏰗􏰄􏰟􏰋􏰒􏰄􏰏􏰠 􏰘􏰈􏰋􏰒 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉􏰃􏰏􏰋􏰘􏰠􏰝 􏰤􏰋􏰘􏰈 􏰏􏰂􏰍􏰃􏰗􏰋􏰘􏰈􏰙􏰋􏰟 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒 􏰘􏰂 􏰙􏰃􏰉􏰃􏰍􏰄 􏰘􏰈􏰄 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠 􏰂􏰗􏰐􏰄􏰗􏰢
􏰼􏰏􏰘􏰈􏰂􏰚􏰍􏰈 􏰘􏰈􏰄 􏰋􏰉􏰉􏰄􏰗 􏰤􏰂􏰗􏰅􏰋􏰉􏰍􏰒 􏰂􏰊 􏰈􏰄􏰃􏰎􏰒 􏰃􏰗􏰄 􏰋􏰉􏰘􏰄􏰗􏰄􏰒􏰘􏰋􏰉􏰍􏰝 􏰤􏰄 􏰤􏰋􏰏􏰏 􏰉􏰂􏰘 􏰍􏰂 􏰋􏰉􏰘􏰂 􏰐􏰄􏰘􏰃􏰋􏰏 􏰈􏰄􏰗􏰄 􏰥 􏰠􏰂􏰚 􏰟􏰃􏰉 􏰦􏰉􏰐 􏰍􏰗􏰄􏰃􏰘 􏰙􏰃􏰘􏰄􏰗􏰋􏰃􏰏 􏰂􏰉 􏰘􏰈􏰄􏰙 􏰋􏰉 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰒 􏰛􏰂􏰂􏰅􏰒 􏰒􏰚􏰍􏰍􏰄􏰒􏰘􏰄􏰐 􏰋􏰉 􏰘􏰈􏰄 􏰒􏰠􏰏􏰏􏰃􏰛􏰚􏰒􏰝 􏰂􏰗 􏰌􏰃􏰗􏰋􏰂􏰚􏰒 􏰂􏰉􏰏􏰋􏰉􏰄 􏰒􏰂􏰚􏰗􏰟􏰄􏰒􏰢 􏰧􏰊 􏰠􏰂􏰚 􏰤􏰃􏰉􏰘 􏰘􏰂 􏰍􏰂 􏰊􏰚􏰗􏰘􏰈􏰄􏰗􏰝 􏰠􏰂􏰚 􏰟􏰃􏰉 􏰘􏰗􏰠 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰃 􏰈􏰄􏰃􏰎 􏰠􏰂􏰚􏰗􏰒􏰄􏰏􏰊􏰝 􏰛􏰚􏰘 􏰘􏰈􏰋􏰒 􏰋􏰒 􏰛􏰄􏰠􏰂􏰉􏰐 􏰘􏰈􏰄 􏰒􏰟􏰂􏰎􏰄 􏰂􏰊 􏰘􏰈􏰋􏰒 􏰟􏰂􏰚􏰗􏰒􏰄􏰢
􏰡􏰂􏰗􏰘􏰈􏰋􏰒􏰄􏱂􏰄􏰗􏰟􏰋􏰒􏰄􏰝􏰤􏰄􏰤􏰋􏰏􏰏􏰋􏰉􏰒􏰘􏰄􏰃􏰐􏰚􏰒􏰄􏰃􏰛􏰚􏰋􏰏􏰘􏰥􏰋􏰉􏰈􏰄􏰃􏰎􏰜􏰚􏰄􏰚􏰄􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰊􏰗􏰂􏰙􏰘􏰈􏰄 heapq 􏰏􏰋􏰛􏰗􏰃􏰗􏰠􏰢􏰣􏰈􏰋􏰏􏰄􏰋􏰘 􏰋􏰒􏰌􏰄􏰗􏰠􏰟􏰂􏰉􏰌􏰄􏰉􏰋􏰄􏰉􏰘􏰝􏰋􏰘􏰐􏰂􏰄􏰒􏰉􏰂􏰘􏰋􏰉􏰊􏰃􏰟􏰘􏰈􏰃􏰌􏰄􏰃􏰏􏰂􏰍􏰃􏰗􏰋􏰘􏰈􏰙􏰋􏰟􏰥􏰘􏰋􏰙􏰄 delete 􏰙􏰄􏰘􏰈􏰂􏰐􏰂􏰊􏰃􏰒􏰘􏰃􏰉􏰐􏰃􏰗􏰐􏰈􏰄􏰃􏰎􏰢 􏰽􏰈􏰄􏰗􏰄􏰊􏰂􏰗􏰄 􏰤􏰄 􏰒􏰚􏰍􏰍􏰄􏰒􏰘 􏰠􏰂􏰚 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰗􏰄􏰏􏰠􏰋􏰉􏰍 􏰂􏰉 􏰆􏰚􏰒􏰘 􏰋􏰉􏰒􏰄􏰗􏰘􏰋􏰂􏰉 􏰃􏰉􏰐 􏰄􏱂􏰘􏰗􏰃􏰟􏰘􏰋􏰉􏰍 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙􏰝 􏰃􏰒 􏰊􏰂􏰏􏰏􏰂􏰤􏰒􏰢
􏰧􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄􏰕 􏰶􏰒􏰘􏰃􏰗􏰘􏰋􏰉􏰍 􏰌􏰄􏰗􏰘􏰄􏱂 􏰷
􏰽􏰈􏰄 􏰒􏰄􏰘 􏰂􏰊 􏰌􏰄􏰗􏰘􏰋􏰟􏰄􏰒 􏰍􏰂􏰉􏰄 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰒􏰂 􏰊􏰃􏰗 􏱏 􏰄􏰙􏰎􏰘􏰠􏰝 􏰃􏰐􏰐 􏰘􏰂
􏰽􏰈􏰄 􏰒􏰈􏰂􏰗􏰘􏰄􏰒􏰘 􏰐􏰋􏰒􏰘􏰃􏰉􏰟􏰄􏰒 􏰘􏰂 􏰃􏰏􏰏 􏰌􏰄􏰗􏰘􏰋􏰟􏰄􏰒􏰕 􏰐􏰋􏰟􏰘􏰋􏰂􏰉􏰃􏰗􏰠 􏰕
􏰼 􏰈􏰄􏰃􏰎 􏰜􏰚􏰄􏰚􏰄 􏰂􏰊 􏰘􏰚􏰎􏰏􏰄􏰒 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒 􏰋􏰉 􏰂􏰗􏰐􏰄􏰗􏰄􏰐 􏰛􏰠 􏰘􏰈􏰄􏰋􏰗 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰶􏰆􏰚􏰒􏰘 􏰊􏰂􏰗 􏰉􏰂􏰤􏰷
􏰸􏰃􏰋􏰉 􏰏􏰂􏰂􏰎􏰕 􏰣􏰈􏰋􏰏􏰄 􏰋􏰒 􏰉􏰂􏰘 􏰄􏰙􏰎􏰘􏰠􏰕
􏰧􏰊 􏰤􏰄 􏰈􏰃􏰌􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰃􏰏􏰏 􏰉􏰂􏰐􏰄􏰒􏰝 􏰛􏰗􏰄􏰃􏰅 􏰘􏰈􏰄 􏰏􏰂􏰂􏰎 􏰃􏰉􏰐 􏰦􏰉􏰋􏰒􏰈 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰯􏰘􏰈􏰄􏰗􏰤􏰋􏰒􏰄􏰝 􏰄􏱂􏰘􏰗􏰃􏰟􏰘 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙􏰥􏰌􏰃􏰏􏰚􏰄 􏰌􏰄􏰗􏰘􏰄􏱂 􏰊􏰗􏰂􏰙 􏰃􏰒 􏰝 􏰃􏰐􏰐 􏰘􏰂 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰖􏰂 􏰘􏰈􏰗􏰂􏰚􏰍􏰈 􏰃􏰏􏰏 􏰄􏰐􏰍􏰄􏰒 􏰄􏰉􏰐􏰋􏰉􏰍 􏰋􏰉 􏰕
􏰡􏰂􏰗 􏰃􏰉􏰠 􏰝 􏰋􏰊 􏰘􏰈􏰄 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰋􏰒 􏰏􏰂􏰤􏰄􏰗 􏰘􏰈􏰃􏰉 􏰟􏰚􏰗􏰗􏰄􏰉􏰘
􏰘􏰈􏰄 􏰚􏰎􏰐􏰃􏰘􏰄􏰐 􏰃􏰉􏰐 􏰋􏰘􏰒 􏰒􏰟􏰂􏰗􏰄 􏰋􏰉􏰘􏰂 􏰢 􏰽􏰈􏰄 􏰈􏰄􏰃􏰎 􏰜􏰚􏰄􏰚􏰄 􏰤􏰋􏰏􏰏 􏰘􏰈􏰄􏰉 􏰅􏰄􏰄􏰎 􏰘􏰗􏰃􏰟􏰅 􏰂􏰊 􏰘􏰈􏰄 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰋􏰄􏰒 􏰂􏰊 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒􏰢
􏰽􏰃􏰅􏰄 􏰃 􏰙􏰂􏰙􏰄􏰉􏰘 􏰘􏰂 􏰚􏰉􏰐􏰄􏰗􏰒􏰘􏰃􏰉􏰐 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏱊􏰂􏰘􏰄 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰋􏰒 􏰎􏰗􏰄􏰒􏰄􏰉􏰘􏰄􏰐 􏰒􏰏􏰋􏰍􏰈􏰘􏰏􏰠 􏰐􏰋􏱌􏰄􏰗􏰄􏰉􏰘􏰏􏰠 􏰘􏰈􏰃􏰉 􏰋􏰉 􏰘􏰈􏰄 􏰏􏰄􏰟􏰘􏰚􏰗􏰄 􏰋􏰉 􏰘􏰈􏰃􏰘 􏰘􏰈􏰄 􏰛􏰄􏰒􏰘 c􏰚􏰗􏰗en􏰘 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄􏰒 􏰃􏰗􏰄 􏰅􏰄􏰎􏰘 􏰋􏰉 􏰛􏰂􏰘􏰈 􏰃􏰉􏰐 􏰋􏰉 􏰢 􏰣􏰄 􏰃􏰗􏰄 􏰅􏰄􏰄􏰎􏰋􏰉􏰍 􏰃 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠 􏰜􏰚􏰄􏰚􏰄 􏰂􏰊 􏰘􏰈􏰄 􏱎􏰛􏰄􏰒􏰘􏱎 􏰉􏰂􏰐􏰄􏰒 􏰤􏰄 􏰟􏰂􏰚􏰏􏰐 􏰄􏱂􏰎􏰏􏰂􏰗􏰄 􏰉􏰄􏱂􏰘􏰝 􏰄􏱂􏰃􏰟􏰘􏰏􏰠 􏰃􏰒 􏰤􏰄 􏰒􏰈􏰂􏰚􏰏􏰐 􏰊􏰂􏰗 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰢 􏰲􏰚􏰘 􏰤􏰄 􏰃􏰗􏰄 􏰋􏰉 􏰊􏰃􏰟􏰘 􏰃􏰐􏰐􏰋􏰉􏰍 􏰘􏰂􏰂 􏰙􏰃􏰉􏰠 􏰘􏰈􏰋􏰉􏰍􏰒 􏰋􏰉􏰘􏰂 􏰘􏰈􏰄 􏰜􏰚􏰄􏰚􏰄􏰢 􏰽􏰈􏰃􏰘 􏰋􏰒􏰝 􏰤􏰈􏰄􏰉􏰄􏰌􏰄􏰗 􏰤􏰄 􏰚􏰎􏰐􏰃􏰘􏰄 􏰃 􏰉􏰂􏰐􏰄􏰩􏰒 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰶􏰘􏰂 􏰛􏰄 􏰏􏰂􏰤􏰄􏰗􏰷􏰝 􏰤􏰄 􏰃􏰐􏰐 􏰋􏰘 􏰘􏰂 􏰝 􏰄􏰌􏰄􏰉 􏰋􏰊 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰉􏰂􏰐􏰄 􏰃􏰏􏰗􏰄􏰃􏰐􏰠 􏰄􏱂􏰋􏰒􏰘􏰒 􏰋􏰉 􏰢 􏰣􏰄 􏰉􏰄􏰌􏰄􏰗 􏰗􏰄􏰙􏰂􏰌􏰄 􏰘􏰈􏰄 􏰄􏰃􏰗􏰏􏰋􏰄􏰗 􏰋􏰉􏰒􏰘􏰃􏰉􏰟􏰄 􏰂􏰊 􏰘􏰈􏰄 􏰒􏰃􏰙􏰄 􏰉􏰂􏰐􏰄􏰢 􏰽􏰈􏰄 􏰚􏰎􏰐􏰃􏰘􏰄􏰐 􏰏􏰂􏰤􏰄􏰗 􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃 􏰒􏰟􏰂􏰗􏰄 􏰤􏰋􏰏􏰏 􏰈􏰃􏰌􏰄 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠 􏰂􏰌􏰄􏰗 􏰘􏰈􏰄 􏰂􏰏􏰐 􏰂􏰉􏰄􏰝 􏰛􏰚􏰘 􏰘􏰈􏰄 􏰜􏰚􏰄􏰚􏰄 􏰤􏰋􏰏􏰏 􏰍􏰗􏰂􏰤 􏰛􏰄􏰟􏰃􏰚􏰒􏰄 􏰂􏰊 􏰘􏰈􏰋􏰒􏰢 􏰧􏰘 􏰋􏰒 􏰘􏰈􏰄􏰗􏰄􏰊􏰂􏰗􏰄 􏰚􏰒􏰄􏰊􏰚􏰏 􏰘􏰂 􏰛􏰗􏰄􏰃􏰅 􏰘􏰈􏰄 􏰏􏰂􏰂􏰎 􏰂􏰉􏰟􏰄 􏰤􏰄 􏰈􏰃􏰌􏰄 􏰌􏰋􏰒􏰋􏰘􏰄􏰐 􏰃􏰏􏰏 􏰘􏰈􏰄 􏰉􏰂􏰐􏰄􏰒􏰢
􏰝 􏰚􏰎􏰐􏰃􏰘􏰄 􏰝 􏰃􏰉􏰐 􏰋􏰉􏰒􏰄􏰗􏰘
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
16/17

2020/11/22 􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7
􏰽􏰈􏰋􏰒 􏰋􏰒 􏰉􏰂􏰘 􏰘􏰈􏰄 􏰙􏰂􏰒􏰘 􏰄􏰏􏰄􏰍􏰃􏰉􏰘 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰂􏰊 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰝 􏰛􏰚􏰘 􏰋􏰘 􏰋􏰒 􏰚􏰒􏰄􏰊􏰚􏰏 􏰃􏰉􏰐 􏰙􏰚􏰟􏰈 􏰊􏰃􏰒􏰘􏰄􏰗 􏰘􏰈􏰃􏰉 􏰘􏰈􏰄 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰃􏰛􏰂􏰌􏰄􏰢
􏱁􏰚􏰄􏰒􏰘􏰋􏰂􏰉 􏱉
􏰬􏰂􏰙􏰎􏰏􏰄􏰘􏰄􏰘􏰈􏰄􏰨􏰋􏰆􏰅􏰒􏰘􏰗􏰃􏰩􏰒􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉􏰋􏰉􏰘􏰈􏰄􏰪􏰠􏰘􏰈􏰂􏰉􏰦􏰏􏰄 ses07_weighted_e􏰘tra.p􏰚 􏰚􏰒􏰋􏰉􏰍 􏰘􏰈􏰄􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒􏰂􏰊􏰘􏰈􏰄 heapq 􏰙􏰂􏰐􏰚􏰏􏰄􏰢
􏰾􏰄􏰗􏰄 􏰃􏰗􏰄 􏰘􏰈􏰄 􏰈􏰄􏰃􏰎 􏰜􏰚􏰄􏰚􏰄 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒 􏰠􏰂􏰚􏰩􏰏􏰏 􏰚􏰒􏰄􏰕
heapif􏰚(Q) 􏰕 􏰋􏰉􏰋􏰘􏰋􏰃􏰏􏰋􏰿􏰄􏰒 􏰘􏰈􏰄 􏰈􏰄􏰃􏰎 􏰜􏰚􏰄􏰚􏰄 􏰶􏰄􏰍 􏰊􏰗􏰂􏰙 􏰃 􏰏􏰋􏰒􏰘 Q 􏰷
heappop(Q) 􏰕 􏰄􏱂􏰘􏰗􏰃􏰟􏰘􏰒 􏰶􏰗􏰄􏰘􏰚􏰗􏰉􏰒􏰷 􏰘􏰈􏰄 􏰙􏰋􏰉􏰋􏰙􏰚􏰙􏰥􏰌􏰃􏰏􏰚􏰄 􏰄􏰏􏰄􏰙􏰄􏰉􏰘 􏰊􏰗􏰂􏰙 􏰘􏰈􏰄 􏰈􏰄􏰃􏰎 􏰜􏰚􏰄􏰚􏰄 heappush(Q, element) 􏰕 􏰋􏰉􏰒􏰄􏰗􏰘􏰒 􏰃􏰉 􏰄􏰏􏰄􏰙􏰄􏰉􏰘 􏰋􏰉􏰘􏰂 􏰘􏰈􏰄 􏰜􏰚􏰄􏰚􏰄 􏰶􏰟􏰂􏰗􏰗􏰄􏰟􏰘􏰏􏰠 􏰊􏰂􏰗 􏰋􏰘􏰒 􏰎􏰗􏰋􏰂􏰗􏰋􏰘􏰠􏰷
􏱊􏰂􏰘􏰋􏰟􏰄􏰘􏰈􏰃􏰘􏰘􏰈􏰄 heapq 􏰙􏰂􏰐􏰚􏰏􏰄doe􏰒no􏰘c􏰗ea􏰘ea􏰒epa􏰗a􏰘eda􏰘a􏰒􏰘􏰗􏰚c􏰘􏰚􏰗e􏰝􏰛􏰚􏰘􏰤􏰂􏰗􏰅􏰒􏰂􏰉􏰃􏰒􏰘􏰃􏰉􏰐􏰃􏰗􏰐􏰪􏰠􏰘􏰈􏰂􏰉 􏰏􏰋􏰒􏰘􏰢 􏰧􏰘 􏰚􏰒􏰄􏰒 􏱎􏰈􏰄􏰃􏰎 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒􏱎 􏰘􏰂 􏰅􏰄􏰄􏰎 􏰘􏰈􏰄 􏰏􏰋􏰒􏰘 􏰋􏰉 􏰘􏰈􏰄 􏰈􏰄􏰃􏰎 􏰂􏰗􏰐􏰄􏰗􏰝 􏰤􏰈􏰄􏰗􏰄 􏰘􏰈􏰄 􏰦􏰗􏰒􏰘 􏰄􏰏􏰄􏰙􏰄􏰉􏰘 􏰋􏰒 􏰘􏰈􏰄 􏰂􏰉􏰄 􏰤􏰋􏰘􏰈 􏰘􏰈􏰄 􏰏􏰂􏰤􏰄􏰒􏰘 􏰟􏰂􏰒􏰘􏰝 􏰃􏰉􏰐 􏰘􏰈􏰄 􏰗􏰄􏰙􏰃􏰋􏰉􏰋􏰉􏰍 􏰄􏰏􏰄􏰙􏰄􏰉􏰘􏰒 􏰃􏰗􏰄 􏰂􏰗􏰐􏰄􏰗􏰄􏰐 􏰋􏰉 􏰃 􏰤􏰃􏰠 􏰘􏰈􏰃􏰘 􏰙􏰃􏰅􏰄􏰒 􏰏􏰂􏰍􏰃􏰗􏰋􏰘􏰈􏰙􏰋􏰟 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒 􏰎􏰂􏰒􏰒􏰋􏰛􏰏􏰄􏰢 􏰡􏰂􏰗 􏰐􏰄􏰘􏰃􏰋􏰏􏰒 􏰂􏰉 􏰈􏰄􏰃􏰎 􏰂􏰎􏰄􏰗􏰃􏰘􏰋􏰂􏰉􏰒 􏰃􏰉􏰐 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰋􏰉􏰍 􏰃 􏰈􏰄􏰃􏰎 􏰋􏰉 􏰪􏰠􏰘􏰈􏰂􏰉􏰝 􏰒􏰄􏰄 􏰸􏰋􏰏􏰏􏰄􏰗 􏰃􏰉􏰐 􏰫􏰃􏰉􏰚􏰙􏰩􏰒 􏰟􏰈􏰃􏰎􏰘􏰄􏰗􏰒 􏱇􏰢􏱉􏰥 􏱇􏰢􏰭􏰴 􏰂􏰉 􏰈􏰄􏰃􏰎􏰒 􏰶􏰈􏰘􏰘􏰎􏰕􏰳􏰳􏰋􏰉􏰘􏰄􏰗􏰃􏰟􏰘􏰋􏰌􏰄􏰎􏰠􏰘􏰈􏰂􏰉􏰢􏰂􏰗􏰍􏰳􏰟􏰂􏰚􏰗􏰒􏰄􏰏􏰋􏰛􏰳􏰒􏰘􏰃􏰘􏰋􏰟􏰳􏰎􏰠􏰘􏰈􏰂􏰉􏰐􏰒􏰳􏰽􏰗􏰄􏰄􏰒􏰳􏰘􏰂􏰟􏰘􏰗􏰄􏰄􏰢􏰈􏰘􏰙􏰏􏰷􏰢 􏱊􏰂􏰘􏰋􏰟􏰄 􏰘􏰈􏰃􏰘 􏰒􏰋􏰉􏰟􏰄 􏰃 􏰈􏰄􏰃􏰎 􏰋􏰒 􏰄􏰞􏰟􏰋􏰄􏰉􏰘 􏰃􏰘 􏰅􏰄􏰄􏰎􏰋􏰉􏰍 􏰋􏰘􏰄􏰙􏰒 􏰒􏰂􏰗􏰘􏰄􏰐􏰝 􏰋􏰘 􏰏􏰄􏰉􏰐􏰒 􏰋􏰘􏰒􏰄􏰏􏰊 􏰘􏰂 􏰃 􏰒􏰂􏰗􏰘􏰋􏰉􏰍 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙 􏰟􏰃􏰏􏰏􏰄􏰐 heap 􏰒o􏰗􏰘􏰢
􏰬􏰂􏰙􏰎􏰃􏰗􏰄 􏰘􏰈􏰄 􏰃􏰏􏰍􏰂􏰗􏰋􏰘􏰈􏰙􏰩􏰒 􏰒􏰎􏰄􏰄􏰐 􏰤􏰋􏰘􏰈 􏰘􏰈􏰃􏰘 􏰂􏰊 􏰘􏰈􏰄 􏰦􏰗􏰒􏰘 􏰋􏰙􏰎􏰏􏰄􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰊􏰂􏰗 􏰏􏰃􏰗􏰍􏰄􏰗 􏰍􏰗􏰃􏰎􏰈􏰒􏰢 􏱄􏰂􏰚 􏰟􏰃􏰉 􏰍􏰄􏰉􏰄􏰗􏰃􏰘􏰄 􏰒􏰋􏰙􏰎􏰏􏰄 􏰗􏰃􏰉􏰐􏰂􏰙 􏰍􏰗􏰃􏰎􏰈􏰒 􏰚􏰒􏰋􏰉􏰍 􏰘􏰈􏰄 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉 random graph 􏰋􏰉 ses07 weighted e􏰘tra.p􏰚 􏰢 􏰾􏰄􏰗􏰄􏰩􏰒 􏰂􏰉􏰄
nodes = [str(i) f􏰅􏰉 i i􏰆 range(1000)] # Crea􏰎e nodes 􏰎ha􏰎 are named in􏰎egers
ma􏰘_edges = 100000 # Ma􏰘 n􏰜mber of edges for random graph
# Crea􏰎e random graph and 􏰎ime 􏰎he 􏰎􏰒o algori􏰎hms
g = random_graph(nodes, ma􏰘_edges)
len(g.list_edges())
start = nodes[0]
%􏰎i􏰋ei􏰎 dijkstra_heap(g,start)
%􏰎i􏰋ei􏰎 dijkstra(g,start)
􏰽􏰈􏰄 􏰏􏰃􏰒􏰘 􏰘􏰤􏰂 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰒􏰝 􏰎􏰗􏰄􏰟􏰄􏰐􏰄􏰐 􏰛􏰠 􏰎􏰄􏰗􏰟􏰄􏰉􏰘􏰃􏰍􏰄 􏰒􏰠􏰙􏰛􏰂􏰏􏰒􏰝 􏰤􏰂􏰗􏰅 􏰋􏰉 􏰑􏰎􏰠􏰐􏰄􏰗􏰩􏰒 􏰧􏰪􏰠􏰘􏰈􏰂􏰉 􏰟􏰂􏰉􏰒􏰂􏰏􏰄 􏰶􏰃􏰉􏰐 􏰋􏰉 􏰃 􏱊􏰂􏰘􏰄􏰛􏰂􏰂􏰅􏰷􏰢 􏰽􏰈􏰄􏰠 􏰤􏰋􏰏􏰏 􏰉􏰂􏰘 􏰤􏰂􏰗􏰅 􏰋􏰉 􏰒􏰘􏰃􏰉􏰐􏰃􏰗􏰐 􏰪􏰠􏰘􏰈􏰂􏰉 􏰦􏰏􏰄􏰒􏰢 􏰽􏰈􏰄􏰠 􏰃􏰗􏰄 􏰟􏰃􏰏􏰏􏰄􏰐 􏱎􏰙􏰃􏰍􏰋􏰟􏱎 􏰧􏰪􏰠􏰘􏰈􏰂􏰉 􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰒􏰝 􏰃􏰉􏰐 􏰃􏰗􏰄 􏰚􏰒􏰄􏰐 􏰊􏰂􏰗 􏰃􏰐􏰐􏰋􏰉􏰍 􏰟􏰂􏰉􏰌􏰄􏰉􏰋􏰄􏰉􏰘 􏰊􏰚􏰉􏰟􏰘􏰋􏰂􏰉􏰃􏰏􏰋􏰘􏰠 􏰘􏰂 􏰪􏰠􏰘􏰈􏰂􏰉􏰢 􏰡􏰂􏰗 􏰙􏰂􏰗􏰄 􏰂􏰉 􏰧􏰪􏰠􏰘􏰈􏰂􏰉 􏰙􏰃􏰍􏰋􏰟􏰝 􏰒􏰄􏰄
􏰽􏰈􏰋􏰒 􏰟􏰈􏰃􏰎􏰘􏰄􏰗 􏰶􏰈􏰘􏰘􏰎􏰒􏰕􏰳􏰳􏰆􏰃􏰅􏰄􏰌􏰐􏰎􏰢􏰍􏰋􏰘􏰈􏰚􏰛􏰢􏰋􏰂􏰳􏰪􏰠􏰘􏰈􏰂􏰉􏰨􏰃􏰘􏰃􏰑􏰟􏰋􏰄􏰉􏰟􏰄􏰾􏰃􏰉􏰐􏰛􏰂􏰂􏰅􏰳􏰴􏰭􏰢􏰴􏰵􏰥􏰙􏰃􏰍􏰋􏰟􏰥􏰟􏰂􏰙􏰙􏰃􏰉􏰐􏰒􏰢􏰈􏰘􏰙􏰏􏰷 􏰂􏰊 􏰘􏰈􏰄 􏰨􏰃􏰘􏰃 􏰑􏰟􏰋􏰄􏰉􏰟􏰄 􏰾􏰃􏰉􏰐􏰛􏰂􏰂􏰅
􏰽􏰈􏰄 􏰧􏰪􏰠􏰘􏰈􏰂􏰉 􏰐􏰂􏰟􏰚􏰙􏰄􏰉􏰘􏰃􏰘􏰋􏰂􏰉 􏰶􏰈􏰘􏰘􏰎􏰕􏰳􏰳􏰋􏰎􏰠􏰘􏰈􏰂􏰉􏰢􏰗􏰄􏰃􏰐􏰘􏰈􏰄􏰐􏰂􏰟􏰒􏰢􏰋􏰂􏰳􏰄􏰉􏰳􏰒􏰘􏰃􏰛􏰏􏰄􏰳􏰋􏰉􏰘􏰄􏰗􏰃􏰟􏰘􏰋􏰌􏰄􏰳􏰙􏰃􏰍􏰋􏰟􏰒􏰢􏰈􏰘􏰙􏰏􏰷
􏰇􏰈􏰃:///U􏰂􏰃􏰉􏰂/􏰊􏰄􏰋􏰃􏰆􏰃􏰌/D􏰃􏰂􏰍􏰎􏰅􏰏/􏰂􏰃􏰂07/􏰂􏰃􏰂􏰂􏰄􏰅􏰆_7.􏰐􏰎􏰋􏰈
17/17