https://github.com/marcelm/tgp

Transitive graph projection – greedy heuristic
https://github.com/marcelm/tgp

Last synced: about 1 year ago
JSON representation

Transitive graph projection – greedy heuristic

• Host: GitHub
• URL: https://github.com/marcelm/tgp
• Owner: marcelm
• License: mit
• Created: 2025-06-07T09:36:39.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2025-06-07T09:38:42.000Z (about 1 year ago)
• Last Synced: 2025-06-07T10:26:59.878Z (about 1 year ago)
• Language: Python
• Size: 0 Bytes
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Transitive graph projection - greedy heuristic

A greedy algorithm for solving the transitive graph projection problem.

This is old code written for my diploma thesis in 2007.

The algorithm has also been published in a paper:

Exact and Heuristic Algorithms for Weighted Cluster Editing.

Sven Rahmann, Tobias Wittkop, Jan Baumbach, Marcel Martin, Anke Truß, Sebastian Böcker

https://www.lifesciencessociety.org/CSB2007/toc/391.2007.html

The original code was written in Python 2.

It can be run using Conda:

    conda create -n tgp python==2.7

    conda activate tgp

    easy_install networkx==0.99

    python rewedge.py data/*.cm

Run the tests:

    easy_install pytest==3.0.0

    pytest