-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have very large data set it is almost 450000 lines and two rows, i want to compute adjacency matrix using python, because previously i have tried to do it in matlab, and it shows memory error because of large data values. my data values also start from 100 and goes upto 450000,
Anyone can help…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I currently have an algorithm that operates on an adjacency matrix of size n by m. In my algorithm, I need to zero out entire rows or columns at a time. My implementation is currently O(m) or O(n) depending on if it's a column or row.
Is there any way to zero out a column or row in O(1) time?
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Graph < Integer, Integer> g = new SparseMultigraph<Integer, Integer>();
g.addVertex(1);g.addVertex(2);g.addVertex(3);
g.addEdge(0,1,2 ,EdgeType.DIRECTED);g.addEdge(1,2,3 ,EdgeType.DIRECTED);g.addEdge(2,3,1 ,EdgeType.DIRECTED);g.addEdge(3,1,3 ,EdgeType.DIRECTED);
How can I convert…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi I am am trying to complete an assignment, where it is ok to consult the online community. I have to create a graph class that ultimately can do Breadth First Search and Depth First Search. I have been able to implement those algorithms successfully however another requirement is to be able to…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
New to R, and I have a long-ish question:
I have a shapefile/map, and I'm aiming to calculate a certain index for every polygon in that map, based on attributes of that polygon and each polygon that neighbors it.
I have an adjacency matrix -- which I think is the same as a "1st-order queen contiguity…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
What are some clever (not ordinary) ways of implementing data structures in C, and what are some data structures that should be used more often?
For example, what is the most effective way (generating minimal overhead) to implement a directed and cyclic graph with weighted edges in C?
I know that…
>>> More
-
as seen on Programmers
- Search for 'Programmers'
When we design applications, we generally end up with the same tiered sets of data structures:
A persistent data structure that is described using DDL and implemented as RDBMS tables and columns.
A set of domain objects that consist primarily of data structures, usually combined with business-rule…
>>> More
-
as seen on Programmers
- Search for 'Programmers'
I am a newbie into the corporate world recently graduated in computers. I am a java/groovy developer. I am a quick learner and I can learn new frameworks, APIs or even programming languages within considerably short amount of time. Albeit that, I must confess that I was not so strong in data structures…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
I have to design a data structure that is to be used in a multi-threaded environment. The basic API is simple: insert element, remove element, retrieve element, check that element exists. The structure's implementation uses implicit locking to guarantee the atomicity of a single API call.…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
There is a large stream of numbers coming in such as 5 6 7 2 3 1 2 3 .. What kind of data structure is suitable for this problem given the constraints that elements must be inserted in descending order and duplicates should be eliminated.
I am not looking for any code just ideas? I was thinking…
>>> More
