graphml
What is a .graphml file?
application/graphml+xml
GraphML is an XML-based format for describing graphs — nodes, edges, and typed attributes (keys) on either. It supports directed and undirected graphs, and is widely read by network tools such as Gephi, NetworkX, and yEd. Being plain XML, it is human-readable and easy to transform.
How to use a .graphml file
Use an example GraphML file to test graph and network importers, layout tools, and converters between GraphML, GEXF, and adjacency formats, or to verify that node and edge attributes survive a round-trip.
Download example .graphml files
- Social Network Graph (GraphML)A small synthetic social network in GraphML — 12 people in two communities with a few bridging ties, carrying node attributes (name, age, community) and weighted edges. Twinned with a GEXF file for testing graph importers and format converters.
- Service Dependency Graph (GraphML, directed)A directed service-dependency graph in GraphML — ten microservices (web, api, auth, db, cache, queue, worker, …) with their call/dependency edges. A fixture for testing directed-graph importers, cycle detection, and topological sorting.
- Directed Acyclic Pipeline - GraphMLA six-stage software pipeline DAG for testing dependency import, cycle checks and reproducible topological sorting. This GraphML member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Directed Dependency Cycle - GraphMLA four-service directed cycle whose only valid topological result is failure, for dependency-analysis regression tests. This GraphML member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Disconnected Directed Graph - GraphMLA directed graph with two linked islands and one isolated node, designed for weak-component and isolated-node tests. This GraphML member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Weighted Directed Multigraph - GraphMLA weighted acyclic multigraph with two parallel source-to-router edges, checking multiplicity and floating-point weight preservation. This GraphML member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Dependency Graph (GraphML)The dependency graph in GraphML, with typed attribute keys for node version, licence and depth and for edge range — the interchange format graph databases and analysis tools import. Every package, version, hash and licence is fictional — the tree describes nothing real.