6 Replies - 2123 Views - Last Post: 05 November 2012 - 06:30 AM

#1 ishan3243   User is offline

  • New D.I.C Head

Reputation: 1
  • View blog
  • Posts: 17
  • Joined: 29-October 12

Digraph as Rooted Tree

Posted 02 November 2012 - 07:17 AM

what could be the real life application of finding whether a given digraph is a rooted tree??

This post has been edited by macosxnerd101: 02 November 2012 - 07:22 AM
Reason for edit:: Renamed title to be more descriptive

Is This A Good Question/Topic? 0
  • +

Replies To: Digraph as Rooted Tree

#2 macosxnerd101   User is offline

  • Games, Graphs, and Auctions
  • member icon




Reputation: 12618
  • View blog
  • Posts: 45,778
  • Joined: 27-December 08

Re: Digraph as Rooted Tree

Posted 02 November 2012 - 07:23 AM

Moved to Computer Science.
Was This Post Helpful? 0
  • +
  • -

#3 ishan3243   User is offline

  • New D.I.C Head

Reputation: 1
  • View blog
  • Posts: 17
  • Joined: 29-October 12

Re: Digraph as Rooted Tree

Posted 02 November 2012 - 07:29 AM

i don't understand.....moved to cs??
Was This Post Helpful? 0
  • +
  • -

#4 macosxnerd101   User is offline

  • Games, Graphs, and Auctions
  • member icon




Reputation: 12618
  • View blog
  • Posts: 45,778
  • Joined: 27-December 08

Re: Digraph as Rooted Tree

Posted 02 November 2012 - 07:30 AM

You posted your thread in Java. This isn't a question that requires Java programming; it is a computer science question. As such, I moved your thread to the appropriate forum- the Computer Science forum.
Was This Post Helpful? 0
  • +
  • -

#5 KYA   User is offline

  • Wubba lubba dub dub!
  • member icon

Reputation: 3202
  • View blog
  • Posts: 19,235
  • Joined: 14-September 07

Re: Digraph as Rooted Tree

Posted 04 November 2012 - 12:19 PM

digraph: directed graph
rooted tree: a tree in which there is a root node with edges coming towards or going away from it

So, with those definitions in mind, what would be a real life application in getting a digraph as input and figuring out if it a rooted tree?

Let's take a Binary Search Tree as an example. It is a rooted digraph. If we did not know what the relationship between nodes was when we received said tree, it would be of enormous benefit to discover that there is a root and the contents of the graph are sorted accordingly.

Pretty much any example I can think of revolves around information gathering about the relationship of the data in the graph. I conjecture there are others, but this is probably the most important.
Was This Post Helpful? 0
  • +
  • -

#6 ishan3243   User is offline

  • New D.I.C Head

Reputation: 1
  • View blog
  • Posts: 17
  • Joined: 29-October 12

Re: Digraph as Rooted Tree

Posted 05 November 2012 - 05:05 AM

can someone tell me an application outside comp sci or math??
Was This Post Helpful? 0
  • +
  • -

#7 macosxnerd101   User is offline

  • Games, Graphs, and Auctions
  • member icon




Reputation: 12618
  • View blog
  • Posts: 45,778
  • Joined: 27-December 08

Re: Digraph as Rooted Tree

Posted 05 November 2012 - 06:30 AM

There really aren't a ton. It's not like you're going to sit as an accountant, manager, trashman, etc., and use a digraph so formally.
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1