Cluster, partition, cut-out, component, cores
- Definition of cluster and partition of vertices
- Manual drawing in Pajek
- weakly connected components
- strongly connected components
- biconnected components
- Components and cores in Pajek
- Find all types of components and cores
in given networks. Extract interesting parts of networks.
- Find number and sizes of weakly, strongly, and biconnected components.
Draw strongly connected components using different colors of vertices.
If the network consists of several
strongly connected components extract and draw the largest strongly connected component.
Find the highest core according to incoming arcs, extract it, draw it and explan the results.
The same must be done for outgoing arcs.
- Interpretation of results.
Slides Pajek 2.05 (PDF)
Slides - the latest version of Pajek (PDF)