Jaega

SteamID64: 76561198202647930
SteamID32: [U:1:242382202]
SteamID: STEAM_0:0:121191101
CommunityURL: https://steamcommunity.com/id/the_jaega/
ProfileURL: https://steamcommunity.com/profiles/76561198202647930

Unique Views: 1
Total Views: 1

You must log in to use these features

Status: Offline
Privacy: Public
Profile Setup: True
Premium: UNK

Creation: 2015-06-20 00:46:42 (GMT)
Last Updated: 2024-04-16 11:43:25

VAC Banned: False
Community Banned: False
Game Banned: False
Trade Banned: False

Persona History

RealName	Time Changed
Jaacob	2024-04-04 22:49:11

URL	Time Changed
https://steamcommunity.com/id/the_jaega/	2024-04-04 22:49:11

State	Time Changed
Public	2024-04-04 22:49:11 [Estimated]

Total: [1] | Deleted: [0]

Commenter	Message	Timestamp
DuckyE	Here we will discuss Kruskal’s algorithm to find the MST of a given weighted graph. In Kruskal’s algorithm, sort all edges of the given graph in increasing order. Then it keeps on adding new edges and nodes in the MST if the newly added edge does not form a cycle. It picks the minimum weighted edge at first at the maximum weighted edge at last. Thus we can say that it makes a locally optimal choice in each step in order to find the optimal solution. Hence this is a Greedy Algorithm.How to find MST using Kruskal’s algorithm?Below are the steps for finding MST using Kruskal’s algorithm:1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest edge. Check if it forms a cycle with the spanning tree formed so far. If the cycle is not formed, include this edge. Else, discard it. 3. Repeat step#2 until there are (V-1) edges in the spanning tree.Kruskal’s algorithm to find the minimum cost spanning tree uses the greedy approach.	2023-07-20 08:24:01

Total: [0] | TF2BD: [0] (0%) | SB: [0] (0%)

Friend	FriendDate	UnfriendDate