TheUnknown

VPN keeps logs.If he does something really stupid.They can trace him back.

If they want to do it,they can.You go through your ISP's servers to connect to the VPN then the VPN does the rest.They can find you if they want to.

Ik ,I am using a temporary vector to store there index/position.

I am not irate.The fact is that I asked something else and you ppl are answering something else...

2D vector of pairs: 0: 6-62 7-68 2-98 1: 6-13 6-25 6-37 3-27 3-19 1-17 2: 5-13 5-25 5-37 2-27 2-19 3: Are you satisfied?Now please stop feeling this thread with useless replies. 0 is a node 6 is the weight and 62 is the node that goes to.

I can't say that for Sapphire products.But you are right...

Storing the graph is not really my problem.I stored the graph using 2D vectors of pairs(you don't really care about pairs though) So lets say the map(2d vector) looks like this Vmap[0][0]: 5 Vmap[0][1] : 6 Vmap[1][0]: 8 Vmap[1][1]: 10 So lets say Vmap[0] is my a node.That node goes to 5 and 6.My problem is to find the position of the node 5 (Vmap[0][0]) in the array.So lets say its position is like Vmap[2].Somebody suggest me to use the actual value (5) as the position it self( ex Vmap[5]) but in my case the numbers are way more complex and can't be used to link to an address in the array.

I want to know the element's position.adjacency matrix takes too much memory. Adjacency matrix takes a lot of memory.The graph is huge and storing it in an adjacency matrix will feel unnecessary physical memory space Vectors are dynamic containers that store data.They give you the ability to access,manipulate or change the stored elements dynamically.I think they only exist in C/C++ and Java(not sure for Java though)

The real problem has numeric values to be honest.But they are not in order and they are random ( >100 ) EDIT-Plus its a vector.Not a simple array with 100 rows I'll just assign the position of the node in an array and I'll search for it every time.Pretty lame for a programmer but it works...

Is there a better way of finding an element's position in an adjacency list of a graph than storing its position and then comparing the whole array to find it?(pairs are already used) I have a weighted graph and lets say I know that from A I can go to B and has a cost of 5.I used a 2d vector of pairs to store this. Ex: A: B-5,C-6,D-7 (explanation : A goes to B with a cost of 5 , it also goes to C with a cost of 6 etc...) B: G-6 ,W-6 H: V-5 A goes to B , B goes to G and W. What I want to do is find a way to access the memory of B without having to store it in a temporary array.Which means that I will need to search it every time to find it. Any ideas? EDIT-This isn't homework exercise by the way.

Thank you man.I will probably end up downloading it duo to its compatibility and portability.

I'll try my Ubuntu first if I don't succeed I'll search the distribution up.

Thank you sir

Does anyone know a good software(GUI or not,for windows or linux) that cracks hashes using your GPU.And it does support r9 270x?

Thank you guys