I am trying to build a list of limitations of all graph algorithms

Posted by Jack on Stack Overflow See other posts from Stack Overflow or by Jack
Published on 2010-04-09T12:16:52Z Indexed on 2010/04/09 12:33 UTC
Read the original article Hit count: 316

Filed under:

algorithm

|

graphs

Single Source shortest Path

Dijkstra's - directed and undirected - works only for positive edge weights - cycles ??

Bellman Ford - directed - no cycles should exist

All source shortest path

Floyd Warshall - no info

Minimum Spanning Tree

( no info about edge weights or nature of graph or cycles)

Kruskal's

Prim's - undirected

Baruvka's

© Stack Overflow or respective owner

Related posts about algorithm

Jpeg Algorithm vs BMP Algorithm?

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
word disambiguation algorithm (Lesk algorithm)

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
Search algorithm (with a sort algorithm already implemented)

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
Is there any algorithm for finding LINES by PIXEL COLORS on picture?

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
collsion issues with quadtree [on hold]

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

Related posts about graphs

C# Generate MRTG/RRD like Graphs Performance graphs?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a database with Performance counter data and i would like to show this on a ASP.net page but the thing is i don't want to use Flash based charting solution or a Javascript based solution i would like to just generate images and use those I want the images to be like those of RRD or MRTG. I'm… >>> More
Create Custom Web-based Graphs with the Google Chart API and PHP

as seen on Internet.com - Search for 'Internet.com'
Presenting data visually can quickly reveal crucial trends. Learn how to use the Google Chart API in conjunction with PHP to create a variety of useful charts. >>> More
Working with Graphs and Gauges in JDeveloper 11

as seen on Oracle Technology Network - Search for 'Oracle Technology Network'
New how-to's on the data visualization components >>> More
What scientific plotting software is available?

as seen on Ask Ubuntu - Search for 'Ask Ubuntu'
I am currently doing some experimental work and I have a lot of data to trawl though. I use Gnumeric, and it's very good, but often I feel there has to be something better. Ideally I would like the maximum number of features with a minimal learning curve, but really I'd just like to know if there… >>> More
How to apply numerical integration on a graph layout

as seen on Game Development - Search for 'Game Development'
I've done some basic 1 D integration, but i can't wrap my head around things and apply it to my graph layout. So, consider the picture below: if i drag the red node to the right, i'm forcing his position to my mouse position the other nodes will "follow" him, but how ? For Verlet, to compute the… >>> More