User contributions

Jump to: navigation, search
Search for contributions
 
 
     
  

  • 17:55, 29 November 2013 (diff | hist) . . (+2). . Data Structures/Graphs(n choose 2 doesn't include self loops. If you include self loops there are n+1 choose 2 ordered pairs. For example, take a 3 vertex undirected graph. It has 4 choose 2 = 6 edges ( {1,2}, {1,3}, {2,3}, {1,1}, {2,2}, {3,3}).)