| Feature | Adjacency List | |
|---|---|---|
| Multiple Graphs per Document |  | |
| Nodes |  | |
| Undirected Edges | | |
| Directed Edges |  | |
| Hyperedges | | |
| Mixed-directionality Edges | | |
| Parallel Edges | | |
| Self-loops | | |
| Edges on Edges | | |
| Nested Graphs in Nodes | | |
| Nested Graphs in Edges | | |
| Nested Graphs in Graphs | | |
| Node Labels | | |
| Edge Labels | | |
| Attributes on Nodes | | |
| Attributes on Edges | | |
| Attributes on Graphs | | |
| Typed Edges | |
Frequently Asked Questions
How do I convert a Adjacency List file?
Upload or paste your Adjacency List file above — the input is preset to Adjacency List — then pick a target format and download the result. It is free and runs in your browser.
What can I convert Adjacency List to?
Choose any supported output above, such as GraphML, DOT, GML or Connected JSON. The comparison table shows how Adjacency List lines up with the target you pick.
Is converting Adjacency List free?
Yes. Conversion runs in your browser, with no account and nothing to install.