This record contains five medium-sized multi-labeled graph datasets: dblp, enron, github, gowalla, and wikitalk. These datasets are originally from SNAP. These files follow the structure below: 1. Header Line (`t`): Starts with `t`, followed by t
👤
CreatorChen, Weitian
📅
Published2025-12-19
🔗
DOI10.5281/zenodo.17990755
📊
Downloads145
File Size138.9 MB
Data TypeDataset
Published2025
Total Views114
Total Downloads145
This record contains five medium-sized multi-labeled graph datasets: dblp, enron, github, gowalla, and wikitalk. These datasets are originally from SNAP. These files follow the structure below:
1. Header Line (`t`):
Starts with `t`, followed by two integers representing:
Total number of vertices
Total number of edges
2. Vertex Lines (`v`):
Each line starts with `v`, followed by three integers per vertex:
Vertex ID (0-based index)
Label (arbitrary numeric value)
Degree (number of edges connected to this vertex)
3. Edge Lines (`e`):
Each line starts with `e`, followed by two vertex IDs (0-based) representing an undirected edge between them.
Edges are unordered (e.g., `e 0 1` is the same as `e 1 0`).
This format defines an undirected graph where vertices are labeled and degrees are explicitly listed for each node. For a graph $g$, the first line should be `t` $|V(g)|$ $|E(g)|$, followed by $|V(g)|$ vertex lines and $|E(g)|$ edge lines. Each vertex $v V(g)$ has a unique vertex ID from 0 to $|V(g)|-1$.
We use cookies to improve your experience and analyze site traffic. By clicking "Accept", you consent to our use of cookies. Privacy Policy · Cookie Policy