| 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 file to Adjacency List?
Upload or paste your graph above in any supported input format, then download it as Adjacency List. It is free and runs in your browser.
Which formats can I convert to Adjacency List?
Pick any supported input, such as GraphML, DOT, GML or Connected JSON, and convert it to Adjacency List in one step.
Is converting to Adjacency List free?
Yes. Conversion runs in your browser, with no account and nothing to install.