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.
<?xml version="1.0" encoding="UTF-8"?>
<graphml xmlns="http://graphml.graphdrawing.org/xmlns">
<key id="d_label" for="node" attr.name="label" attr.type="string"/>
<graph id="deps" edgedefault="directed">
<node id="n0"><data key="d_label">web</data></node>
<node id="n1"><data key="d_label">api</data></node>
<node id="n2"><data key="d_label">auth</data></node>
<node id="n3"><data key="d_label">db</data></node>
<node id="n4"><data key="d_label">cache</data></node>
<node id="n5"><data key="d_label">queue</data></node>
<node id="n6"><data key="d_label">worker</data></node>
<node id="n7"><data key="d_label">mailer</data></node>
<node id="n8"><data key="d_label">storage</data></node>
<node id="n9"><data key="d_label">metrics</data></node>
<edge id="e0" source="n0" target="n1"/>
<edge id="e1" source="n0" target="n2"/>
<edge id="e2" source="n1" target="n2"/>
<edge id="e3" source="n1" target="n3"/>
<edge id="e4" source="n1" target="n4"/>
<edge id="e5" source="n1" target="n5"/>
<edge id="e6" source="n5" target="n6"/>
<edge id="e7" source="n6" target="n3"/>
<edge id="e8" source="n6" target="n7"/>
<edge id="e9" source="n6" target="n8"/>
<edge id="e10" source="n1" target="n9"/>
<edge id="e11" source="n6" target="n9"/>
<edge id="e12" source="n2" target="n3"/>
</graph>
</graphml>
Specifications
- Nodes
- 10
- Edges
- 13
- Directed
- true
- Domain
- software architecture
What is a .graphml file?
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 this 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.
Related files
- gexfSocial Network Graph (GEXF)The same 12-person social network in GEXF 1.3 (Gephi's native format) — node attributes and weighted edges. The format twin of the GraphML file, for testing Gephi imports and GraphML↔GEXF conversion.
- graphmlSocial 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.
- csv10,000-Row CSVA CSV with 10,000 data rows — for testing streaming parsers, memory handling, and import performance.
- logApache Access Log — Combined Format (log)An Apache access log in the Combined Log Format — the Common fields plus referer and user-agent. A realistic web-server log for testing access-log parsers, analytics, and grok patterns.
- logApache Access Log — Common Format (log)An Apache access log in the Common Log Format (CLF) — client, timestamp, request line, status, and byte count. Deterministic, with reserved documentation IPs. Paired with a Combined-format twin for testing log parsers.
- csvBank Transactions (CSV, 60 rows)A bank-transaction statement — 60 debits and credits across three accounts (masked numbers) with running balances, categories, and merchants. Synthetic data for testing statement parsers, categorisation, and reconciliation.
Generated by generation/data_graphs.py. Free for any use, no attribution required — license.