መነሻምድቦችኔትወርኮች እና ግራፍ ቲዎሪ

🌐 ኔትወርኮች እና ግራፍ ቲዎሪ

በኃይል የሚመሩ ግራፎች፣ ስፓኒንግ ትሪዎች፣ የኔትወርክ ጽናት እና ትንሽ-ዓለም ክስተቶች።

19 ማስመሰያዎች60 fps እውነተኛ-ጊዜ0 የመጫኛ ደረጃዎች
Force-Directed GraphFruchterman-Reingold spring layout for Erdős-Rényi, Barabási-Albert and Watts-Strogatz… Minimum Spanning TreeStep-by-step animation of Kruskal's and Prim's MST algorithms on a weighted graph. Toggle… Network ResilienceBarabási–Albert scale-free and Erdős–Rényi random networks under targeted hub attack vs… Small-World Networks — Watts-StrogatzStart from a regular ring lattice and rewire edges with probability p: watch clustering and… Scale-Free Network — Barabási-Albert Preferential AttachmentBarabási-Albert preferential attachment: new nodes connect with probability proportional to… Network ScienceSwitch between Erdős–Rényi, Barabási–Albert and Watts–Strogatz graph models: force-directed… TCP Congestion ControlNewTCP's congestion window: slow-start doubling, AIMD increase, multiplicative decrease on loss… Max-Flow / Min-CutNewRun Ford–Fulkerson (Edmonds–Karp) step by step: BFS finds augmenting paths, pushes flow… Community Detection (Louvain)NewDetect communities by greedily maximizing modularity with the Louvain method. Watch local… Internet RoutingNewDistance-vector routing (Bellman–Ford/RIP) can count to infinity; link-state (Dijkstra/OSPF)… Critical Path (CPM/PERT)NewModel a project as a DAG: forward/backward pass computes ES/EF/LS/LF and slack; zero-slack… PageRankNewGoogle's original ranking algorithm: a page's score is (1−d)/N plus d times inbound… Topological Sort — Ordering a DAGNewOrder a DAG's vertices so every edge points forward. Watch Kahn's algorithm peel off… Floyd-Warshall — All-Pairs Shortest PathsNewFloyd-Warshall finds shortest paths between every vertex pair in O(V³) by relaxing through… Bipartite Matching — Augmenting PathsNewFind a maximum matching in a bipartite graph via augmenting paths flipping matched and… DNS Resolution — Recursive Lookup & CachingNewTrace a DNS lookup from resolver to root, TLD and authoritative servers, then watch TTL… Random Graph — Giant Component & Phase TransitionNewConstruct an Erdos-Renyi G(n,p) random graph: as average degree crosses 1, a giant connected… Network Percolation — Giant Component ThresholdNewAdd random edges to nodes and watch the giant connected component emerge at p_c = 1/N.… Viral Spread on Contact NetworkNewAn SIR epidemic on a heterogeneous contact network — hubs spread it faster. Adjust β, γ and…
ስለ ምድቡ

ኔትወርኮች እና ግራፍ ቲዎሪ

በኃይል የሚመሩ ግራፎች፣ ስፓኒንግ ትሪዎች፣ የኔትወርክ ጽናት እና ትንሽ-ዓለም ክስተቶች።

Three.js · WebGL 60 FPS CC BY 4.0
ፈጣን እውነታዎች
19በዚህ ምድብ ውስጥ ያሉ በይነተገናኝ ማስመሰያዎች
በማንኛውም ዘመናዊ አሳሽ በ60 FPS ይሰራል
🌐በእንግሊዝኛ፣ ዩክሬንኛ፣ ፖላንድኛ፣ ስፓንኛ፣ ጀርመንኛ፣ ጃፓንኛ፣ ጣሊያንኛ፣ ፖርቱጋልኛ (BR)፣ ፈረንሳይኛ፣ አረብኛ፣ ደች፣ ቻይንኛ፣ ኮሪያኛ፣ ሂንዲ፣ ቱርክኛ፣ ቬትናምኛ፣ ራሽያኛ፣ ኢንዶኔዥያኛ፣ ፋርስኛ፣ ቤንጋልኛ፣ ታይላንድኛ፣ ፊሊፒንኛ፣ ስዋሂሊኛ፣ ኡርዱ፣ ማላይኛ፣ ታሚልኛ፣ ዕብራይስጥ፣ ግሪክኛ፣ ፑንጃብኛ፣ አማርኛ፣ ብርማኛ፣ ክመርኛ፣ ጆርጂያኛ፣ ኔፓልኛ፣ ሞንጎሊያኛ፣ አርሜንኛ፣ ሲንሃላኛ፣ ላኦኛ፣ ቼክኛ፣ ሮማንያኛ፣ ሃንጋሪኛ፣ ቡልጋሪያኛ እና ስዊድንኛ ይገኛል
🎓CC BY 4.0 — ለክፍል ትምህርት እና ለLMS ተሳትፎ ነጻ

በተደጋጋሚ የሚጠየቁ ጥያቄዎች

ኔትወርኮች እና ግራፍ ቲዎሪ ማስመሰያዎችን ለማስኬድ ምንም ነገር መጫን ያስፈልገኛል?

አያስፈልግም። ሁሉም ኔትወርኮች እና ግራፍ ቲዎሪ ማስመሰያዎች በቀጥታ በድር አሳሽዎ ውስጥ ይሰራሉ፤ ምንም ፕለጊን ወይም ልዩ ሶፍትዌር ሳያስፈልግ። ኮምፒውተር፣ ታብሌት ወይም ስልክ ብቻ በበቂ ኢንተርኔት ግንኙነት ይኖርዎት።

እነዚህ ማስመሰያዎች ለት/ቤት ወይም ለክፍል ትምህርት ተስማሚ ናቸው?

አዎ። እያንዳንዱ ማስመሰያ ተማሪዎች ሳይንሳዊ ፅንሰ ሐሳቦችን በተግባር በመሞከር እና ውጤቱን በቀጥታ በማየት እንዲረዱ ተደርጎ የተነደፈ ነው፤ ለክፍል ውስጥ ማሳያ ወይም ለግል ጥናት ተስማሚ ነው።

የማስመሰያ ውጤቶቼን ማስቀመጥ ወይም ማጋራት እችላለሁ?

አብዛኞቹ ማስመሰያዎች ቅንብሮችን በቀጥታ በአሳሽዎ ውስጥ እንዲቀይሩ እና ውጤቱን በቅጽበት እንዲመለከቱ ያስችሉዎታል፤ የገጹን አድራሻ (URL) በማጋራት ለሌሎችም ማሳየት ይችላሉ።

ተዛማጅ ምድቦች

ምን አገኙ?

የመድገሚያ ደረጃዎችን ጨምር (አማራጭ)