Two Related Problems:
1. Imagine polyamorous people form a complicated network. Define each person as a unique node. Define a relationship between two people as an edge.
Each node can possibly have N types of edges to directly connect to another node. Each node at least needs to connect one of the rest of the nodes with one of the N types of edges, so that each node connected with each node, directly or through other nodes. Imagine there are X nodes, how many possible variations of the network are there?
- Imagine the nodes are now indistinguishable from each other. How many possible variations of the network are there?