gexf
What is a .gexf file?
application/gexf+xml
GEXF (Graph Exchange XML Format) is an XML format for graphs created for the Gephi network-analysis tool. It describes nodes and edges with attributes and also supports dynamic (time-evolving) graphs and visual properties like position and colour. It is a common interchange format alongside GraphML.
How to use a .gexf file
Use an example GEXF file to test network importers and visualisers (especially Gephi), and converters between GEXF and GraphML, or to check that node/edge attributes and weights are parsed correctly.
Download example .gexf files
- Social 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.
- Directed Acyclic Pipeline - GEXF 1.3A six-stage software pipeline DAG for testing dependency import, cycle checks and reproducible topological sorting. This GEXF 1.3 member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Directed Dependency Cycle - GEXF 1.3A four-service directed cycle whose only valid topological result is failure, for dependency-analysis regression tests. This GEXF 1.3 member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Disconnected Directed Graph - GEXF 1.3A directed graph with two linked islands and one isolated node, designed for weak-component and isolated-node tests. This GEXF 1.3 member carries the same node IDs, edge IDs, directions and weights as its two format twins.
- Weighted Directed Multigraph - GEXF 1.3A weighted acyclic multigraph with two parallel source-to-router edges, checking multiplicity and floating-point weight preservation. This GEXF 1.3 member carries the same node IDs, edge IDs, directions and weights as its two format twins.