viktor.slavkovic's Profile User Rating: -----

Reputation: 2 Apprentice
Group:
Members
Active Posts:
20 (0.02 per day)
Joined:
27-June 12
Profile Views:
1,010
Last Active:
User is offline Aug 07 2014 05:21 AM
Currently:
Offline

Previous Fields

Country:
Who Cares
OS Preference:
Who Cares
Favorite Browser:
Who Cares
Favorite Processor:
Who Cares
Favorite Gaming Platform:
Who Cares
Your Car:
Who Cares
Dream Kudos:
0
Icon   viktor.slavkovic has not set their status

Posts I've Made

  1. In Topic: minimal cost spanning tree with exactly K white edges

    Posted 19 Apr 2013

    View Postmacosxnerd101, on 19 April 2013 - 08:46 AM, said:

    Edges are incident to two vertices. I'd start by trying to maximize the number of vertices in your spanning forest. If a vertex only has white edges, I'd start with it. Then move onto the vertices with edges of both colors.

    Thank you a lot. It seems to be a good idea. I'll give it a try...
  2. In Topic: minimal cost spanning tree with exactly K white edges

    Posted 19 Apr 2013

    I've tried Kruskal. And then if I used less then K white edges, I discard minimal black edge, or else discard minimal white edge. I repeated this until I've got exactly K edges. It's certainly slow.

    View Postmacosxnerd101, on 18 April 2013 - 09:31 PM, said:

    I would adapt Kruskal's algorithm here since it gives you more global control over the edges than say Prim's algorithm.


    How would you adapt Kruskal?

My Information

Member Title:
New D.I.C Head
Age:
19 years old
Birthday:
March 25, 1995
Gender:
Years Programming:
3
Programming Languages:
Pascal, C++, VB6, VB.net

Contact Information

E-mail:
Private

Friends

Comments

viktor.slavkovic has no profile comments yet. Why not say hello?