DL
title = "simple network, node list format"

N = 4

labels:
A
B
C
D

format = nodelist1 // this is the list format for 1-mode graphs (the adjacency matrix)

// this is the node list
// the format is: NODE AJD-NODE_1 ... AJD-NODE_J
data:
1 2 4
2 1 3
3 2
4 1
; // <- we close the "data:" list with ;

// an even more readable (but redundant) format is with embedded labels
//
// format = nodelist1
// labels embedded
// data:
// A B D
// B A C
// C B
// D A