Results 1 to 2 of 2
  1. #1
    dacoolest is offline Member
    Join Date
    Nov 2011
    Posts
    13
    Rep Power
    0

    Default how to find MST in a directed graph?

    what method to be used to find the MST in a directed graph (e.g.: http://upload.wikimedia.org/wikipedi...mantic_Net.svg) when there are vertices that has no entering edges?

    Thanks.

  2. #2
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Location
    Voorschoten, the Netherlands
    Posts
    14,044
    Blog Entries
    7
    Rep Power
    23

    Default Re: how to find MST in a directed graph?

    A minimal spanning tree is defined for an undirected graph (with weights on the edges), but how is such a tree defined for a directed graph?

    kind regards,

    Jos
    The only person who got everything done by Friday was Robinson Crusoe.

Similar Threads

  1. Graph Problem Java Directed
    By daxter in forum Advanced Java
    Replies: 4
    Last Post: 05-05-2011, 03:00 AM
  2. Graph in Jsp
    By monika in forum New To Java
    Replies: 0
    Last Post: 04-20-2010, 05:47 PM
  3. Self-directed learning
    By Mr.Beans in forum Forum Lobby
    Replies: 3
    Last Post: 05-05-2009, 10:40 PM
  4. How to treverse a Directed Acyclic Graph
    By TalhaS in forum New To Java
    Replies: 0
    Last Post: 03-19-2008, 09:28 PM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •