songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fixes inside a commented example

This commit is contained in:
Andreas Fabri 2021-09-20 19:49:56 +01:00 committed by Sébastien Loriot
parent 3b7754f796
commit 444f347f76
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/auxiliary/graph.h
View File

@ -109,7 +109,7 @@ a minimum cut on the following graph:
///////////////////////////////////////////////////
#include <stdio.h>
#include <iostream>
#include "graph.h"
void main()
@ -125,16 +125,16 @@ void main()
Graph::flowtype flow = g -> maxflow();
printf("Flow = %d\n", flow);
std::cout << "Flow = " << flow << std::endl;
printf("Minimum cut:\n");
if (g->what_segment(nodes[0]) == Graph::SOURCE)
printf("node0 is in the SOURCE set\n");
std::cout << "node0 is in the SOURCE set\n";
else
printf("node0 is in the SINK set\n");
std::cout << "node0 is in the SINK set\n";
if (g->what_segment(nodes[1]) == Graph::SOURCE)
printf("node1 is in the SOURCE set\n");
std::cout << "node1 is in the SOURCE set\n";
else
printf("node1 is in the SINK set\n");
std::cout << "node1 is in the SINK set\n";
delete g;
}