# Clustering Scenarios

# Graph Clustering

**N-clue can cluster the following graphs types:**

## Bipartite graphs

A graph where the nodes are divided into two node sub sets. Edges only exist between different node sets.

## General simple graphs

A simple undirected graph with no self-loops.

## Hierarchy graphs

A special case of n-partite graph which form a hierarchy structure (Fig 1).

### Fig. 1. Hierarchy graph.

## N-partite graphs

A graph where the nodes are divided into n subsets. Edges only exist between different node sets (Fig. 2).