I'm trying to solve a algorithmic contest's problem. I have a matrix 2000x2000. I want to represent it as graph and traverse it with BFS/DFS. I have time limits on app running (2s). Simple vertices ...

I'm currently participating in developing a knowledge graph that uses ConceptNet and a few others as its data sources. It uses the same architecture as ConceptNet namely it is stored as a hypergraph ...

Suppose I have an undirected graph G with vertices v1...vn and edges. Right now it is in adjacency list representation.
For every time moment I have as input some subset of vertices that are "active" ...

Everyone on my team draws branch diagrams differently, including how branches exit or reintegrate to the parent, how cherry-pick merges are shown, and a host of other aesthetic choices.
Is there some ...

Here is the code I use for implementing Dijkstra's algorithm. Consider a graph with n vertices and m edges. Shouldn't it run in O(n^2 m) ? Someone may say that there are n vertices and each edge gets ...

I have a graph in which each node is a geographical point on the surface of the earth, defined by it's latitude / longitude coordinates.
Correct ways to calculate the distance between two such points ...

I have a bunch of x-y graphs given to me and I need to be able to transform them into some kind of data structure from which I will be able to get Y with X value.
The problem is, though that I have 4, ...

So for MST there are 2 possible definitions in an undirected graph. Keep in mind that in an undirected graph the MST algorithm always has n - 1 edges and no cycles.
In an undirected graph, it doesn't ...

I have some DAGs (directed acylic graphs) and I want to merge them in order to minimize the number of nodes (we could say that every node has a cost, while edges are free).
These four different DAGs ...

Note: if you feel that I should include code, please tell me.
I am solving a problem of finding shortest path between nodes. I am given the vertices between nodes, however they are one sided (ie you ...

I have my own knowledge graph representation, read from ConceptNet and NELL, containing tens of millions of nodes in which I want to calculate the nearest distance (if any) between two concept nodes. ...

I'm trying to get all complete subgraph given a graph G. Needless to say it is an NP-problem complete: Clique_problem.
I understand getting the full set is not possible in real time(since it'll take ...

I'm looking for an algorithm that gives me the n nodes that are the farthest away from each other.
Can this be accomplished relatively efficiently?
To clarify my question:
I think of the problem as ...

I'm trying to figure out what sort of data structure to use for modeling some hypothetical, idealized network usage.
In my scenario, a number of users who are hostile to each other are all trying to ...

The purpose of the algorithm is to create n routes on a geographical map, where n is being given, whereas all routes take no longer than t time units by foot and end where they start, while trying to ...

Tarjan's algorithm for finding bridges in a graph is found here: http://en.wikipedia.org/wiki/Bridge_(graph_theory)#Tarjan.27s_Bridge-finding_algorithm.
However, I don't understand the condition for ...

I am looking for a way to solve an assignment problem, but I am having some problems finding the correct algorithm to use.
I have 2 list of nodes A and B, and in my problem may the length of A not be ...

We are given an array of integers where all elements are between 0-9. have to start from the 1st position and reach end in minimum no of moves such that we can from an index i move 1 position back and ...

We have created a REST API for a voting game. Now we are jumping into creating analytics/graphs/charts for moderators and users to watch how are they doing in the game.
The game has a certain group ...

So this may be a question that is born of my inability to properly express my intentions to Google.
In a fully connected non-directional graph such that any three points can be properly represented ...

I have a problem about the calculation of shortest paths on an unweighted and undirected graph.
Which algorithm I use to calculate the shortest path between a node A and node B that passing through a ...

I've written some code to manipulate sparse graphs for school work I'm doing, and I have an operation which requires me to loop over all the edges of a graph. The interface I need to implement is some ...

Many literature references suggest that the binary labeling problem can be converted into a graph cut problem and solved with the max flow/min cut algorithm. I'm trying to understand the formulation ...