Why i can't use the function Graph::isEdge in my code??

Question

John Blue 2019-2-16

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/445291-why-i-can-t-use-the-function-graph-isedge-in-my-code

回答： Steven Lord 2019-2-16

This is my code and i try to create a graph

clear all;
fileID = fopen("routers_modify_airports.dat");
data = textscan(fileID,'%q %q');
fclose(fileID);
Data_of_ports = [data{:}];
unique_elements = unique(Data_of_ports);
G = graph;
for i = 1 : length(unique_elements)
    G = addnode(G,unique_elements(i));
end
for i = 1: length(Data_of_ports)  
   G = addedge(G,Data_of_ports(i,1),Data_of_ports(i,2)); 
end

And i have a problem in function addedge because i have two time the same edge . For exapmle

'AER'	'KZN'
'ASF'	'KZN'
'ASF'	'MRV'
'CEK'	'KZN'
'CEK'	'OVB'
'DME'	'KZN'
'DME'	'NBC'
'DME'	'TGK'
'DME'	'UUA'
'EGO'	'KGD'
'EGO'	'KZN'
'GYD'	'NBC'
'KGD'	'EGO'
'KZN'	'AER'

I find a function who check if is the edge exists. But i can't use it.

for i = 1: length(Data_of_ports)
   if (Graph::isEdge(G, [[Data_of_ports(i,2), Data_of_ports(i,1)]] )) == false 
        G = addedge(G,Data_of_ports(i,1),Data_of_ports(i,2));
   end
end

And i have this Error

Do you know how to use this function???

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

madhan ravi 2019-2-16

编辑：madhan ravi 2019-2-16

That function can be used only in MUPAD notebooks where as you are using it in MATLAB script.

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Steven Lord 2019-2-16

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/445291-why-i-can-t-use-the-function-graph-isedge-in-my-code#answer_361317

As madhan ravi said, the function you found is only for MuPAD. Since you're working with the graph object included in MATLAB, use the findedge function instead.

Since both findedge and addedge accept vectors of source and target data, you don't even need the for loop. In fact, you may not even need findedge if you're using a release that supports multigraph (release R2018a) as you could add the edge regardless of whether or not it exists and simplify the multigraph to turn it into a simple (at most one edge between any pair of nodes) at the end.