[Lemon-user] Hao Orlin problem

[Andre Saldanha Oliveira]

Hello, I am trying to use the Hao Orlin algorithm to partition a graph while
minimizing (sort of) the number of edges that cross the cut. 

I am currently having problems figuring out which nodes went to which side of
the cut. I am sending an example code attached to this message. It is compiled
using: 

$ g++ hao_orlin.cpp -o hao_orlin -lemon 

I have tested it and the commented out line causes a segmentation fault. 

What am I doing wrong? How do I use this correctly? 

-- 

-------------------------

André Saldanha Oliveira

Computer Engineering Undergraduate, Universidade Federal do Rio Grande do Sul

Skype: andre.oliveira460

LinkedIn: andresaldanhaoliveira
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20170721/876fd599/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: hao_orlin.cpp
Type: text/x-c
Size: 922 bytes
Desc: not available
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20170721/876fd599/attachment.cpp>