English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

5 answers

Example: in a direct graph, arrows are drawn between all vertices. For each vertex, we can define its "in" degree and "out" degree as the number of arrows leaving from or arriving at the vertex.

Because the total number of incoming arrows is equal to the number of arrows, we have

E = sum_V in(V)

similarly

E = sum_V out(V)

The reason: if you count/enumerate two sets in different ways, you should find the same result.

2006-08-24 16:43:36 · answer #1 · answered by dutch_prof 4 · 0 0

Enumeration is just counting, giving order to a collection of things that might not have order otherwise.

2006-08-24 21:48:03 · answer #2 · answered by Kris W 1 · 0 0

i dont even know what u said man

2006-08-24 21:41:30 · answer #3 · answered by Anonymous · 0 0

1,2,3 is pretty fundamental.

2006-08-24 21:40:47 · answer #4 · answered by normobrian 6 · 0 0

google it...

2006-08-24 22:04:25 · answer #5 · answered by Mimi 2 · 0 0

fedest.com, questions and answers