Разработка программы формирования матрицы смежности

Курсовой проект - Компьютеры, программирование

Другие курсовые по предмету Компьютеры, программирование

texId;(currentNode->oneArc.inVertexId != 0) {= true;= NULL;((currentNode != NULL) && (currentNode->oneArc.outVertexId == newVertexId[counter])) {>oneArc.outVertexId = counter+1;(sidePointer != NULL) {(sidePointer, firstArc);= NULL;

oneArc.inVertexId,adjacentVertex,vertexLevel-1)!=NOT_FOUND){(noOneBefore){>oneArc.inVertexId=0;=currentNode;=currentNode->nextArc;">}(foundInArray(currentNode->oneArc.inVertexId, adjacentVertex, vertexLevel-1) != NOT_FOUND) {(noOneBefore) {>oneArc.inVertexId = 0;= currentNode;= currentNode->nextArc;

} else {= currentNode;= currentNode->nextArc;(nodePointer, firstArc);

};

}(noOneBefore)= false;= currentNode->nextArc;

}

oneArc.outVertexId=counter+1;=currentNode->nextArc;">} else {>oneArc.outVertexId = counter+1;= currentNode->nextArc;

}++;

oneArc.inVertexId==0){=currentNode->nextArc;;">}= firstArc;(currentNode != NULL) {(currentNode->oneArc.inVertexId == 0) {= currentNode->nextArc;;

oneArc.outVertexId;((currentNode!=NULL)&&(currentNode->oneArc.outVertexId==currentId)){>oneArc.inVertexId=foundInArray(currentNode->oneArc.inVertexId,newVertexId,NUM_VERTEX-1)+1;=currentNode->nextArc;">}= currentNode->oneArc.outVertexId;((currentNode != NULL) && (currentNode->oneArc.outVertexId == currentId)) {>oneArc.inVertexId = foundInArray(currentNode->oneArc.inVertexId, newVertexId, NUM_VERTEX-1)+1;= currentNode->nextArc;

}

}

}printNeiborhoodsList(DirectedGraph *firstNode, ostream *stream, int NUM_VERTEX, bool saveMode, string title = "") {*currentNode = firstNode;currentVertex;(!title.empty())

oneArc.outVertexId;">*stream oneArc.outVertexId;

oneArc.inVertexId;=currentNode->nextArc;((currentNode!=NULL)&&(currentNode->oneArc.outVertexId==currentVertex)){">*stream oneArc.outVertexId == currentVertex)) {

oneArc.inVertexId;=currentNode->nextArc;">*stream nextArc;

}

}

} else {(currentNode != NULL) {

oneArc.outVertexId)oneArc.outVertexId) << ": ";

oneArc.inVertexId;=currentNode->nextArc;((currentNode!=NULL)&&(currentNode->oneArc.outVertexId==currentVertex)){">*stream oneArc.outVertexId == currentVertex)) {

oneArc.inVertexId;=currentNode->nextArc;">*stream nextArc;

}

}

}

}**completeAdjacencyMatrix(DirectedGraph *firstNode, int NUM_VERTEX) {*currentNode = firstNode;currentId, rowCounter, colCounter;**adjacencyMatrix = new bool* [NUM_VERTEX];(rowCounter = 0; rowCounter < NUM_VERTEX; rowCounter++) {[rowCounter] = new bool [NUM_VERTEX];(colCounter = 0; colCounter < NUM_VERTEX; colCounter++)[rowCounter][colCounter] = false;

oneArc.inVertexId!=0)[currentNode->oneArc.outVertexId-1][currentNode->oneArc.inVertexId-1]=true;=currentNode->nextArc;">}= firstNode;(currentNode != NULL) {(currentNode->oneArc.inVertexId != 0)[currentNode->oneArc.outVertexId-1][currentNode->oneArc.inVertexId-1] = true;= currentNode->nextArc;

}adjacencyMatrix;

}printMatrix(bool **matrix, int dimension, ostream *stream, string title = "") {rowCounter, colCounter;(!title.empty())

*stream << title;(rowCounter = 0; rowCounter < dimension; rowCounter++) {

*stream << endl << << matrix[rowCounter][0];(colCounter = 1; colCounter < dimension; colCounter++) {

*stream << << matrix[rowCounter][colCounter];

}

}

}clearMatrix(bool **matrix, int dimention) {(int counter = 0; counter < dimention; counter++)[] matrix[counter];[] matrix;

}