Hi I am working on a project where I need to use the maximum cardinality matching algorithm. My graphs are complete and weighted. However, even for moderately large graph instances, I am facing a segmentation fault error. I have complete graphs with 400-5000 vertices (I would like to run the algorithm on much bigger graphs too). The algorithm works fine for smaller instances. It seems that this is a memory issue. My machine has more than enough memory to run such instances (16 GB). Further, earlier I wasn't even able to run graphs with 100-200 nodes. I was able to run them after changing the edge weight property type from "double" to "int_16". Please let me know if there is something else I can do to run this code. It's a pretty large and distributed codebase, so it would be difficult for me to post my code for reference over here. On the other hand, if you feel that this is an issue with the library itself, please fix it. Thanks and Regards Chaitanya Agarwal