Posted
by iva123
on Stack Overflow
See other posts from Stack Overflow
or by iva123
Published on 2010-03-27T11:44:48Z
Indexed on
2010/03/27
23:03 UTC
Read the original article
Hit count: 446
How can we find a longest path in a graph ?? I thought we can use depth first but I couldn't find any easier implemantation for it ?
© Stack Overflow or respective owner
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
