Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Calcul de la composante connexe commune maximale entre deux graphes #41

Open
UnixJunkie opened this issue Jun 25, 2015 · 1 comment
Open

Calcul de la composante connexe commune maximale entre deux graphes #41

UnixJunkie opened this issue Jun 25, 2015 · 1 comment
Labels
new-algo New graph algorithm to be written

Comments

@UnixJunkie
Copy link

Bonjour,

Ca aussi ce n'etait pas dans ocamlgraph a l'epoque je crois.
C'est pourtant bien utilie, notemment pour certains problemes de chimie
ou les graphes sont relativement petits et ou l'algorithme exacte, meme s'il
est lent marche quand-meme.

Est-ce que ca serait possible d'avoir ca dans ocamlgraph?

Merci,
Francois.
@UnixJunkie
Copy link
Author

In my field it is called Maximum Common Substructure (MCS) search, and the exact algorithm is pretty heavy.

@yakobowski yakobowski added the new-algo New graph algorithm to be written label Aug 8, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
new-algo New graph algorithm to be written
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@UnixJunkie @yakobowski