« first day (1145 days earlier)      last day (3289 days later) » 

1:04 PM
@vzn do we not have to show that the output of Kruskal's algorithm is also spanning?
 
 
1 hour later…
2:15 PM
hello @Narendra do you know kruskal's algorithm ?
 
3:10 PM
Hello @Gilles and @WanderingLogic do you know Kruskal's algorithm ?
 
vzn
3:43 PM
@user159870 click on the link its to a subsection of the wikipedia entry with the full proof
 
what does the sentence "Y cannot have a cycle, being within one subtree and not between two different trees." mean? @vzn
 
 
2 hours later…
6:14 PM
Anyone here?
 
 
1 hour later…
7:21 PM
Hello @ResearchEnthusiast !
 
7:47 PM
A little (very) off-topic! I'm a computer scientist and this is my homepage: cs.tau.ac.il/~orzamir - I wanted to add the following easter-egg (click on the elevator at the bottom) cs.tau.ac.il/~orzamir/index_el.html and I'm not sure if it will make it look to unprofessional or anything like that? opinions? :P
 
 
4 hours later…
11:21 PM
@ResearchEnthusiast I saw your homepage. I really like it! Nice!
I saw that one of your interests is Algorithms.
Do you know Kruskal's algorithm? @ResearchEnthusiast
I have a question maybe you can help me. @ResearchEnthusiast
1
Q: The output spanning tree of Kruskal's algorithm is a minimum spanning tree

user159870I want to show that the output spanning tree $S$ of Kruskal's algorithm is a minimum spanning tree, so it is of minimum weight, by contradiction. We suppose that $S$ is not a minimum spanning tree. Let $T$ be a spanning tree which has the minimum weight. How can I go on to get a contradicti...

 

« first day (1145 days earlier)      last day (3289 days later) »