Baalla

attend all your courses do your homeworks and voila you'll be successful student but it needs hard work wish ye the best

i don't know where is the problem or wha i'm missing here but i'm stuck in an infinite loop when i compile it keep desplaying these two cout cout << "\ntotal weight of neighbors of "<< *it <<" is " << " "<< W; cout << "the selected node with …

hello there i'm having a list iterator not incrementable problem i have a adjacency matrix "adj(2d vectors)" + i have a char vector in name color and i have a int glist i'm having a problem with the following function for(list<int>::iterator it = glist.begin(); it != glist.end(); it++) { int …

hello there let me explain my work i have a file i read from it the data after that i try to get the best vertex that it's max(degree/weight) when i find it i put it's neighbors into the glist and i put it into blist and delete both of …

hello i have an adjancy matrix for example [0] 0,44, ( 0 : node / 0,44 it neighbors) [1] 1,3,12, [2] 2,33,40, i need to remove all of the neighbors from a list and push them in another one i wanna start from adj[specific number].begin to adj[specific number].end to remove …

What are the differences between NP vs NP-Complete vs NP-Hard ? I am aware of many resources all over the web. I'd like to read your explanations to undrestand better

hello my problem this time is i have an multidimensional vector and the example of adj vector is showen in the attached picture and i wanna know the size of each one i mean in i=0 the size is 2 i declare a new vector degree to put in it …

i'm having a problem in reading a file i tried my code in code blocks/eclipse c++/netbeans c++ and even visual studio c++ 2010 each time it exits with (-1) while i'm puting the file in the right place for reading i don't know where is the mistake can you please …