hypergz 0.6.3

No project description provided

Installation

$ pip install hypergz

---

Try the algorithm

To run your own example click here

---

Introuction

This repository is an implementation of two algorithms:

1) Force-Directed Graph Drawing Using Social Gravity and Scaling

Link for atricle: https://arxiv.org/pdf/1209.0748.pdf

Authors:

• Michael J. Bannister
• David Eppstein
• Michael T. Goodrich
• Lowell Trott

This algorithm creates a pleasant drawing of a graph in a shape of a circle using attraction and rejection forces as well as social.

This algorithm offers 3 methods of social gravity:

• Centrality by clossness: The closer a vertex is to other vertices the more central it will be.
• Centrality by betweeness: Vertex who is part of more shortest paths will be more central.
• Centrality by degree: Vertex with higher degree will be more central.

Example of different centralities in tree graph

Networkx	Clossness

Betweeness	Degree

2) Hypergraph Drawing by Force-Directed Placement

Link for atricle: https://www.researchgate.net/publication/318823299_Hypergraph_Drawing_by_Force-Directed_Placement

Authors:

• Naheed Anjum Arafat
• Stephane Bressan

This algorithm creates a pleasant drawing of a hyper-graph using any force-directed algrithm. We implemnted with the first algoritm. This algorithm offers 4 methods of converting hyper-graph to a graph (to apply force-directed algorithm on):

• Complete graph: connecting all vertices with all vertices.
• Cycle graph: connecting each vertex to the next vertex.
• Star graph: connecting all vertices to their center of Mass.
• Wheel graph: union of the Cycle and the Star graphs.

Example of different graphs

Complete	Cycle	Betweeness	Degree

Example of hyper-graph with 10 vertices and 8 hyper-edges

Complete	Cycle

Betweeness	Degree

---

The team:

• Amit Sheer Cohen
• Neta Roth