Help Data Structure Curriculum Design C Sequencing of wagons in freight yards

PMIi: I've done a similar one

Your graduation project, I don't usually study in class, and now I want to beg with 30 points, do you really know that the score is money? Boy, don't waste your parents' hard-earned money.

In addition, there are many products on the group IDC network**, which are cheap and have a good reputation.

Hopefully, you can solve the problem that going to school is not easy.

There are many examples on the Internet, so let's do your own research first!!

C is what C language, isn't this SQL? I wonder what do you want?

A copy of the ** in C plus a set of fruits? Is there a test result report inside?

What attitude

You owe you ???

I don't blame you for your bad professional knowledge, you don't even have the basic politeness of being a person, cut · pass

Write a C program, randomly give the adjacency matrix of n*n, and print out the adjacency matrix, as well as the number of edges of the directed graph, the degree of each vertex, and judge whether there is a Euler loop in the graph: (1) If it is of order n, a neighborhood matrix of n*n is randomly generated; (2) The output adjacency matrix, the number of edges, the degree of each vertex, and the presence of Euler loops in the graph. This topic involves two main knowledge points, one is the creation of adjacency matrices for directed graphs in data structures, and the other is the decision theorem of Euler loops in discrete mathematics.

#include

#include

#include

#include

define n 5 defines the order n of the matrix

typedef int ver;

typedef int edg;Define the vertices and edge values of a directed graph as integers.

typedef structgraph;Define the data structure of the adjacency matrix.

void printgraph (graph g) printout adjacency matrix.

void countd (graph g) determines the degree of vertices of a directed graph and determines the Euler loop.

printf("The vertex %d has an out degree: %d",i,c[i]);The out degree of any vertex i of a directed graph is the number of numbers in the adjacency matrix that is not 0 in row i.

printf("");

for (j=0;jprintf("The ingress of vertex %d is: %d",j,d[j]);The degree of penetration of any vertex j of a directed graph is the number of numbers in column j that is not 0 in the adjacency matrix.

for (l=0;lk=0;

if (count==n) to determine the Euler loop: 1: The out degree of all vertices is equal to the in degree;

2: There are only two points with odd degrees, and one out degree is one greater than the in degree.

k=1;The other in-degree is one degree greater than the out-degree, and the other vertices out-degree is equal to the in-degree.

elseif (k==1)

printf("There is a Euler loop in the directed graph");

elseprintf("There is no Euler loop in the directed graph");

void main() main function.

for (i=0;i;for (i=0;i}while (1);}

printf("The resulting adjacency matrix of the directed graph is:");

printgraph(g);

countd (g);Call the subfunction.

printf("The number of edges of a directed graph is: %d",n*(n-1)/2);}