plotnet_curve.m

function plotnet_curve(sbeG,xy,sbeNode)

if nargin<3
    % T=textscan(num2str(1:size(sbeG,1)),'%s'); sbeNode=T{1};
    sbeNode=cellfun(@num2str,num2cell(1:size(sbeG,1)),'Uniform',false);
end
if nargin < 2
    xy=fruchterman_reingold_force_directed_layout(double(sparse(sbeG)));
end

[i,j] = find(sbeG);
[~, p] = sort(max(i,j));
i = i(p);
j = j(p);

X = [ xy(i,1) xy(j,1)]';
Y = [ xy(i,2) xy(j,2)]';

if isfloat(xy)
    X = [X; NaN(size(i))'];
    Y = [Y; NaN(size(i))'];
end
X=X(:); Y=Y(:);


M=[];
for k=1:length(X)-1
    if ~(isnan(X(k))||isnan(X(k+1)))      
      p1=[X(k),Y(k)];
      p2=[X(k+1),Y(k+1)];      
      if ~ismember([p1 p2],M,'rows')
        [a,b]=quadraticcurveto(p1,p2);
        plot(a,b,'-','linesmoothing','off',...
            'color',[.6 .6 .6],'linewidth',1);
        hold on;
        M=[M;[p1,p2]];
        M=[M;[p2,p1]];        
      end      
       %plot([X(k),X(k+1)],[Y(k),Y(k+1)],'r:');       
    end
end
plot(xy(:,1), xy(:,2),'r.');
sbeNodetext=strrep(sbeNode','_','\_');
sbeNodetext=strrep(sbeNodetext,'^','\^');
text(xy(:,1), xy(:,2), sbeNodetext);
set(gcf,'Color',[1,1,1]);
 



function [x,y]=quadraticcurveto(currentp,curvetop,controllp)

%The quadraticCurveTo method creates a line from the path's current point to the specified point, via a controlpoint.
%The quadraticCurveTo method takes four parameters, the x and y coordinates for the controlpoint, and the x and y coordinates for the line's destination.

%Current point moveTo(20,20)
%CurveTo point quadraticCurveTo(20,100,200,20)
%Controllpoint quadraticCurveTo(20,100,200,20)

o=curvetop(1);
i=curvetop(2);
d=currentp(1);
f=currentp(2);

x2=curvetop(1);
%y2=curvetop(2);
x1=currentp(1);
y1=currentp(2);

if nargin<3
    %x3=min([x1,x2])+abs(x1-x2)/2;
    %y3=y1;    controllp=[x3 y3];
    controllp=[(d+o)/2+(i-f)/4,(f+i)/2+(d-o)/4];
end
P=[[currentp';0],[controllp';0],[curvetop';0]];

n=3;
count = 1;
div = 50; %number of segments of the curve (Increase this value to obtain a
          %smoother curve
for u = 0:(1/div):1
    sum = [0 0 0]';
    for i = 1:n
        B = nchoosek(n,i-1)*(u^(i-1))*((1-u)^(n-i+1)); %B is the Bernstein polynomial value
        sum = sum + B*P(:,i);
    end
    B = nchoosek(n,n)*(u^(n));
    sum = sum + B*P(:,n);
    A(:,count) = sum; %the matrix containing the points of curve as column vectors. 
    count = count+1;  % count is the index of the points on the curve.
end

x = A(1,:);
y = A(2,:);