Posted
by nexeww
on Stack Overflow
See other posts from Stack Overflow
or by nexeww
Published on 2009-02-13T16:40:27Z
Indexed on
2010/05/08
15:58 UTC
Read the original article
Hit count: 375
How can I find (iterate over) ALL the cycles in a directed graph from/to a given node?
For example, I want something like this:
A->B->A
A->B->C->A
but not: B->C->B
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
I was wondering how people deal with graph theory in python? How is a graph stored? Are there libraries for this?
For example how would I input a graph and then find its Chromatic polynomial? Or its girth? Or the number of unique spanning trees? How about problems that involve edge weight like salesman…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi, I'm trying to understand the main concepts of graph theory and the algorithms within it. Most algorithms seem to contain a "Relaxation Condition" I'm unsure about what this is.
Could some one explain it to me please.
An example of this is dijkstras algorithm, here is the pseudo-code.
1 …
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have a rectangular planar grid, with each cell assigned some integer weight. I am looking for an algorithm to identify clusters of 3 to 6 adjacent cells with higher-than-average weight. These blobs should have approximately circular shape.
For my case the average weight of the cells not containing…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Please help me find a good solution for this problem.
We have n boxes with 3 dimensions. We can orient them and we want to put them on top of another to have a maximun height. We can put a box on top of an other box, if 2 dimensions (width and lenght) are lower than the dimensions of the box below…
>>> More
as seen on Game Development
- Search for 'Game Development'
Is it possible to robustly find all the graph minors within an arbitrary node graph where the pinch points are generally not single nodes? I have read some other posts on here about how to break up your graph into a Hamiltonian cycle and then from that find the graph minors but it seems to be such…
>>> More
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
