using ant colony algorithm to create cross word game [closed]
Closed 11 years ago.
What algorithm should I use to find the shortest path in this graph?
I have a graph with about a billion vertices, each of which is connected to about 100 other vertices at random.
How can you prove an acyclic graph has n-1 edges? [closed]
Closed 11 years ago.
How can you prove an acyclic graph has n-1 edges? [closed]
Closed 11 years ago.
Languages with graph data structures and algorithms in standard library
I am trying to improve my knowledge and ability with graphs and graph algorithms and have noticed something curious: as far as I can tell no “mainstream” language contains support for graphs in its standard library. Trees yes, graphs no. The only language that comes even remotely close is C++ with Boost (which isn’t technically a “standard library”)
Building a Graph Editor – How to create a data driven graph
I am developing a graph-editor that uses drag and drop to build hierarchical graphs (containing nodes and links). Each node in the graph should be linked to a table in our database (SQL Server). I did a lot of research about libraries based on javascript or/and JSON specifications to draw nodes and links. There are a lot of great examples to follow, but I have no idea about the way I can link a graph to a database (SQL Server, Oracle, MySQL…). I thought about this architecture (Question posted on stackexchange.com)
Where to learn graph theory applications [closed]
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for […]
Where to learn graph theory applications [closed]
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for […]
Algorithm in undirected BFS graph
I’m trying to put together an algorithm that will display the node degree for every node in a breadth first tree graph (assume BFS was called). Assume it’s an undirected graph. I’m not sure how to get the node degree of a node when going through the graph. I was thinking about adding up every occurrence of the node in every list, then adding up all the occurrences within that node’s list (all of them since it’s undirected), but I’m not sure not how to implement. Just answer with pseudocode. I just need the algorithm, then I’ll implement later in a language.
Algorithm in undirected BFS graph
I’m trying to put together an algorithm that will display the node degree for every node in a breadth first tree graph (assume BFS was called). Assume it’s an undirected graph. I’m not sure how to get the node degree of a node when going through the graph. I was thinking about adding up every occurrence of the node in every list, then adding up all the occurrences within that node’s list (all of them since it’s undirected), but I’m not sure not how to implement. Just answer with pseudocode. I just need the algorithm, then I’ll implement later in a language.