# A `igraphdata`

Plots

## A.1 Bridges of Koenigsburg

The city of Koenigsberg in Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River, and included two large islands which were connected to each other and the mainland by seven bridges. The problem was to find a walk through the city that would cross each bridge once and only once. The islands could not be reached by any route other than the bridges, and every bridge must have been crossed completely every time (one could not walk half way onto the bridge and then turn around and later cross the other half from the other side). Euler proved that the problem has no solution.

## A.2 UKfaculty

The personal friendship network of a faculty of a UK university, consisting of 81 vertices (individuals) and 817 directed and weighted connections. The school affiliation of each individual is stored as a vertex attribute. This dataset can serve as a testbed for community detection algorithms.

```
## + 5/81 vertices, from 6f42903:
## [1] 1 2 3 4 5
```

```
## + 5/817 edges from 6f42903:
## [1] 57->52 76->42 12->69 43->34 28->47
```