Posted
by Evilsithgirl
on Stack Overflow
See other posts from Stack Overflow
or by Evilsithgirl
Published on 2010-03-18T02:33:56Z
Indexed on
2010/03/18
2:41 UTC
Read the original article
Hit count: 392
I need write an algortihm to find a cycle in an undirected graph using O(|V|) time independent of O(|E|). So a running time of O(|V| + |E|) won't be accepted. how can i do this? Will Depth-first search work?
© Stack Overflow or respective owner
as seen on Super User
- Search for 'Super User'
I'm just wonder, what the differences are between creating a BMP file algorithm and JPG file algorithm ?
If you know the others images' format algorithm, please post them.
Thanks.
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hii..
Can anybody help me to find an algorithm in Java code to find synonyms of a search word based on the context and I want to implement the algorithm with WordNet database.
For example, "I am running a Java program". From the context, I want to find the synonyms for the word "running", but the…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
Im doing a Java application and Im facing some doubts in which concerns performance.
I have a PriorityQueue which guarantees me the element removed is the one with greater priority. That PriorityQueue has instances of class Event (which implements Comparable interface). Each Event is associated…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
So I have Image like this
I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea)
I need algorithm for finding all straight lines on it by just reading colors of pixels. No hard math, no Haar, no Hough. Some algorithm which would be based on points…
>>> More
as seen on Game Development
- Search for 'Game Development'
So i implemented a Quad tree in Java for my 2D game and everything works fine except for when i run my collision detection algorithm, which checks if a object has hit another object and which side it hit.My problem is 80% of the time the collision algorithm works but sometimes the objects just go…
>>> 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
