From 327c14756e5a37d074d2d7c3691768fac2901e74 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Fran=C3=A7ois=20Pitois?= <francois.pitois@univ-lyon1.fr>
Date: Mon, 24 Feb 2025 11:38:53 +0100
Subject: [PATCH] Markdown informations

---
 AUTHORS.md | 8 ++++++++
 LICENCE.md | 6 ++++++
 README.md  | 7 +++++++
 3 files changed, 21 insertions(+)
 create mode 100644 AUTHORS.md
 create mode 100644 LICENCE.md

diff --git a/AUTHORS.md b/AUTHORS.md
new file mode 100644
index 0000000..3bed14b
--- /dev/null
+++ b/AUTHORS.md
@@ -0,0 +1,8 @@
+# Authors
+
+1. François Pitois, IdHAL: francois-pitois. Affiliation : 1,2
+
+# Affiliations
+
+1. LIRIS, Villeurbanne, France (UMR 5205)
+2. LIB, Dijon, France (EA 7534)
diff --git a/LICENCE.md b/LICENCE.md
new file mode 100644
index 0000000..83693b9
--- /dev/null
+++ b/LICENCE.md
@@ -0,0 +1,6 @@
+This code is under CC BY-NC 4.0
+
+Graphs provided in the directory `graph_batch` are taken from the following databases:
+- Leskovec J. and Krevl A.: *SNAP Datasets: Stanford Large Network Dataset Collection* (2014), http://snap.stanford.edu/data
+- Rossi, R.A. and Ahmed, N.K.: *The network data repository with interactive graph analytics and visualization*. In: Proceedings of the TwentyNinth AAAI Conference on Artificial Intelligence (2015). http://networkrepository.com
+- Rozemberczki, B., Allen, C. and Sarkar, R.: *Multi-scale Attributed Node Embedding* (2019)
diff --git a/README.md b/README.md
index 589f47b..9ac3e21 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,9 @@
 # Fine-Grained Structural Partitioning
 
+This is an algorithm for graph partitionning.
+Run `run.sh path_to_graph`, where graph is a file containing one edge per line.
+An edge should be written as `a,b,w`, where `a`, `b` and `w` are three integers :
+- `a` is the ID of the first vertex,
+- `b` is the ID of the second vertex,
+- `w` is the weight of the edge.
+Weights are ignored in this algorithm, but should be there for compatibily reasons.
-- 
GitLab