-
as seen on Stack Overflow
- Search for 'Stack Overflow'
In a program I am writing, I wrote for two classes (Coordinate, and Graph), with one of them taking the other as constructor arguments.
When I try to compile it I get the following error for Graph.cpp:
Undefined symbols:
"Graph::Coordinate::Coordinate(double)", referenced from:
Graph::Graph()…
>>> More
-
as seen on C# Corner
- Search for 'C# Corner'
We can use GDI+ to draw chart components in C# or VB.NET language in memory and once the components are drawn in memory, we can save the drawing in an image on the Web server. Once the image is saved, we can display this image in an ASP.NET page using any Image tag or image control.
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can anyone please tell me that once I've created a graph using Boost Graph library, how can I display that graph?
My biggest concern is that the edge weights are coming from an exernal data source over the network. And I need to be able to display the edgeweights live as they get updated.
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi, I have a task to draw electrostatic field between
two electrodes( at given sizes and shape ),
what i have now is that i draw the electrodes with area plot (area(elect_x,elect_y))
the graph looks like this:
------------------.---
|..
.---. |..
|...| |…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have an file that is a long list of weighted edges, in the following form
node1_id node2_id weight
node1_id node3_id weight
and so on. So one weighted edge per line.
I want to load this file into boost graph and find the connected components in the graph. Each of these connected components…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have n elements. For the sake of an example, let's say, 7 elements, 1234567. I know there are 7! = 5040 permutations possible of these 7 elements.
I want a fast algorithm comprising two functions:
f(number) maps a number between 0 and 5039 to a unique permutation, and
f'(permutation) maps the…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello!
I want to do permutation in perl. For example I have three arrays. ["big", "tiny", "small"] and then I have ["red", "yellow", "green"] and also ["apple", "pear", "banana"].
How do I get:
["big", "red", "apple"]
["big", "red", "pear"]
..etc..
["small", "green", "banana"]
I understand this…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Continuing to learn prolog, I'm trying to write a permutation(L1, L2) predicate. It should return true, only if L1 can be made up of all elements in L2. My code so far is the following:
permutation([], []).
permutation([H|T], L2) :- remove(L2, H, R), permutation(T, R).
Assuming that the predicate…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Let say a=[A, B, C, D], each element has a weight w, and is set to 1 if selected, 0 if otherwise. I'd like to generate permutation in the below order
1,1,1,1
1,1,1,0
1,1,0,1
1,1,0,0
1,0,1,1
1,0,1,0
1,0,0,1
1,0,0,0
Let's w=[1,2,3,4] for item A,B,C,D ... and max_weight = 4. For each permutation…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm interested making an implementation of the 14-15 puzzle:
I'm creating an array with the values 0 - 15 in increasing order:
S = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }
Now, what I want to do is shuffle them to create a new instance of the puzzle. However, I know that if I…
>>> More
