the release of a new version of the open source graph database, Neo4j, and the
fast-approaching Graph Connect conference...
3 replies - 7117 views - 10/22/12 by Mitch Pronschinske in Articles
As we saw in the previous post, Dijkstra's algorithm
is very useful when it comes to finding all the shortest paths in a
1 replies - 13744 views - 10/22/12 by Stoimen Popov in Articles
We already know how we can find the shortest paths in a graph
starting from a given vertex. Practically we modified breadth-first
0 replies - 14765 views - 10/15/12 by Stoimen Popov in Articles
Since with graphs we can represent real-life problems it’s almost
clear why we would need an efficient algorithm that calculates the...
3 replies - 11803 views - 10/09/12 by Stoimen Popov in Articles
So far we know how to implement graph depth-first and breadth-first
searches. These two approaches are crucial in order to understand graph...
0 replies - 6916 views - 09/25/12 by Stoimen Popov in Articles
So you have all
of this graph-tacular data in your graph database (for this post, I'm
using neo4j). It looks slick with its vertices and edges. People...
0 replies - 3553 views - 09/24/12 by Duncan Brown in Articles
Along with breadth-first search,
depth-first search is one of the two main methods to walk through a
graph. This approach though is...
0 replies - 7481 views - 09/17/12 by Stoimen Popov in Articles
Graph theory and network science
are two related academic fields that have found application in numerous
commercial industries. The terms ‘graph’ and...
0 replies - 37556 views - 08/12/12 by Marko Rodriguez in Articles