The following module was proposed for inclusion in the Module List:
modid: Graph::Matching
DSLIP: Rdpfp
description: Compute maximum weight matchings in graphs
userid: JORISVR (Joris van Rantwijk)
chapterid: 6 (Data_Type_Utilities)
communities:
similar:
rationale:
This is a standard algorithm operating on graph structures, so
existing "Graph" root seems a sensible namespace.
This new module does not otherwise extend or depend on the existing
Graph module by Jarkko Hietaniemi.
enteredby: JORISVR (Joris van Rantwijk)
enteredon: Mon Apr 30 11:01:25 2012 GMT
The resulting entry would be:
Graph::
::Matching Rdpfp Compute maximum weight matchings in graphs JORISVR
Thanks for registering,
--
The PAUSE
PS: The following links are only valid for module list maintainers:
Registration form with editing capabilities:
https://pause.perl.org/pause/authenquery?ACTION=add_mod&USERID=a3a00000_41ec052b0755a924&SUBMIT_pause99_add_mod_preview=1
Immediate (one click) registration:
https://pause.perl.org/pause/authenquery?ACTION=add_mod&USERID=a3a00000_41ec052b0755a924&SUBMIT_pause99_add_mod_insertit=1
Peek at the current permissions:
https://pause.perl.org/pause/authenquery?pause99_peek_perms_by=me&pause99_peek_perms_query=Graph%3A%3AMatching
