# Diferente pentru problema/apdm intre reviziile #6 si #17

### Diferente intre continut:

```==Include(page="template/taskheader" task_id="apdm")==
```
```==Include(page="template/raw")==

```
```Vom considera un graf conex, neorientat, cu \$N\$ varfuri si \$M\$ muchii. Fie \$D(i, j)\$ distanta minima dintre varfurile \$i\$ si \$j\$. Prin diametrul grafului vom defini valoarea \$Max { D(i,j) (1 &le; i < j &le; N) }\$.
h2. Cerinta
```
```h2. Exemplu
```
```table(example). |_. apdm.in |_. apdm.out |_. Explicatie |
```
```table(example). |_. apdm.in |_. apdm.out |
```
```| 8 13
1 2
1 5
```
```5 7
6 7
6 8
```
```| 4
| In desen observam colorate cu verde muchiile unui arbore partial de diametru 4, acestea sunt: (1, 5), (2, 4), (3, 4), (4, 5), (4, 6), (5, 7), (6, 8)
```
```| 4 |

h3. Explicatie

In desen observam colorate cu verde muchiile unui arbore partial de diametru 4, acestea sunt: (1, 5), (2, 4), (3, 4), (4, 5), (4, 6), (5, 7), (6, 8)

!problema/apdm?image001.gif!
```
```==Include(page="template/taskfooter" task_id="apdm")==
```
```

```

```
```
```1006
```