Go to file
Niko Abeler c3cc7f690e refactoring to allow different models 2022-11-20 20:28:23 +01:00
.vscode formatting 2022-11-20 17:09:39 +01:00
src refactoring to allow different models 2022-11-20 20:28:23 +01:00
.gitignore init with maturin 2022-11-20 14:49:43 +01:00
Cargo.lock init with maturin 2022-11-20 14:49:43 +01:00
Cargo.toml init with maturin 2022-11-20 14:49:43 +01:00
DEVELOPMENT.md install and dev 2022-11-20 19:03:45 +01:00
README.md install and dev 2022-11-20 19:03:45 +01:00
pyproject.toml init with maturin 2022-11-20 14:49:43 +01:00
requirements.txt requirements + minimal readme 2022-11-20 17:14:34 +01:00

README.md

Graph Force

A python/rust library for embedding graphs in 2D space, using force-directed layouts.

Installation

pip install graph_force

Usage

import graph_force

edges = [(0, 1), (1, 2), (2, 3), (3, 0)]
pos = graph_force.layout_from_edge_list(4, edges)

Example with networkx

import networkx as nx
import graph_force

G = nx.grid_2d_graph(10, 10)
# we have to map the names to integers
# as graph_force only supports integers as node ids at the moment
edges = []
mapping = {n: i for i, n in enumerate(G.nodes)}
i = 0
for edge in G.edges:
    edges.append((mapping[edge[0]], mapping[edge[1]]))

pos = graph_force.layout_from_edge_list(len(G.nodes), edges, iter=1000)
nx.draw(G, {n: pos[i] for n, i in mapping.items()}, node_size=2, width=0.1)

Contributing