No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
2 Posted Topics
Hi, I have a problem that is shortest path problem. I use dijkstra algorithm but query has a time that is an hour on 280.000 node-graph. I have to reduce query time to 1 second. I try to find these way but I can not found any implementation of these …
Hello everybody, I am using both c and assembly (assembly is with nasm and op:Linux) in C: [CODE]typedef struct linkednode *linkednode_ptr; typedef struct linkednode{ int freq; char symbol; linkednode_ptr node; }; linkednode_ptr get_linkednode(char symbol, int freq) { linkednode_ptr r = (linkednode_ptr)malloc(sizeof(struct linkednode)); r->node=NULL; r->symbol=symbol; r->freq=freq; return r; }[/CODE] in c, …
The End.