Después de de esta extensa recopilación de datos solucionamos esta dificultad que pueden tener algunos de nuestros usuarios. Te compartimos la respuesta y nuestro objetivo es serte de gran apoyo.
Ejemplo 1: convertidor de código c a código python en línea
#include // Defining MAX size to 10#define MAX 10
using namespace std;
typedef struct Edge
int source;int destination;int weight;Edge;
void bellman_ford_algo(int nodevertex,Edge edge[],int source_graph,int nodeedge)int u,v,weight,i,j=0;int distance[MAX];for(i=0;i<nodevertex;i++)
distance[i]=999;// distance of source vertex
distance[source_graph]=0;// free all the edges nodevertex -1 times
for(i=0;i<nodevertex-1;i++)for(j=0;j<nodeedge;j++)
u=edge[j].source;
v=edge[j].destination;
weight=edge[j].weight;if(distance[u]!=999&& distance[u]+weight < distance[v])
distance[v]=distance[u]+weight;// checking for negative cycle
for(j=0;j<nodeedge;j++)
u=edge[j].source;
v=edge[j].destination;
weight=edge[j].weight;if(distance[u]+weight < distance[v])
cout<<"nnNegative Cycle present..!!n";return;
cout<<"nVertex"<<" Distance from source";for(i=1;i<=nodevertex;i++)
cout<<"n"<<i<<"t"<<distance[i];int main()int nodevertex,nodeedge,source_graph;
Edge edge[MAX];
cout<<"Enter the number of vertices you want : ";
cin>>nodevertex;
printf("Enter the source vertex of the graph: ");
cin>>source_graph;
cout<<"nEnter no. of edges you want : ";
cin>>nodeedge;for(int i=0;i<nodeedge;i++)
cout<<"nEdge Number "<<i+1<<"=";
cout<<"nEnter source vertex here :";
cin>>edge[i].source;
cout<<"Enter destination vertex here:";
cin>>edge[i].destination;
cout<<"Enter weight here :";
cin>>edge[i].weight;
bellman_ford_algo(nodevertex,edge,source_graph,nodeedge);return0;
Ejemplo 2: conversión de código c en línea a código python
#include
using namespace std;
void main()for(int i=1, i<=5, i++)for(int j=1, j<=i,j++)
printf("%c",64+j)
printf("n")
Ejemplo 3: convertir código python a c en línea
defmain():# 4 x 4 csr matrix# [1, 0, 0, 0],# [2, 0, 3, 0],# [0, 0, 0, 0],# [0, 4, 0, 0],
csr_values =[2,3,1,4,5]
col_idx =[1,2,0,1,1]
row_ptr =[0,2,4,5]
csr_matrix =[
csr_values,
col_idx,
row_ptr
]
dense_matrix =[[0,3,0],[1,4,5],[2,0,0],]
res =[[0,0,0],[0,0,0],[0,0,0],]# matrix order, assumes both matrices are square
n =len(dense_matrix)# res = dense X csr
csr_row =0# Current row in CSR matrixfor i inrange(n):
start, end = row_ptr[i], row_ptr[i +1]for j inrange(start, end):
col, csr_value = col_idx[j], csr_values[j]for k inrange(n):
dense_value = dense_matrix[k][csr_row]
res[k][col]+= csr_value * dense_value
csr_row +=1print(res)if __name__ =='__main__':
main()
Puedes añadir valor a nuestro contenido cooperando tu experiencia en las notas.
¡Haz clic para puntuar esta entrada!
(Votos: 0 Promedio: 0)