World's most popular travel blog for travel bloggers.

Total number of edges in the graph

, , No Comments
Problem Detail: 

Consider a directed graph with nodes {1,2,3...n} and include an edge (i,j) whenever i<j.

According to me, it should be n(n-1)/2 but the book says it's nC2(combinations).

Asked By : Rajat Saxena
Answered By : Tom van der Zanden

Did you try working out what n choose 2 evaluates to?

Best Answer from StackOverflow

Question Source :

3200 people like this

 Download Related Notes/Documents


Post a Comment

Let us know your responses and feedback