Architecture for Social Graph data that has a Time Frame Associated?
I am adding some “social” type features to an existing application. There are a limited # of node & edge types. Overall the data itself is relatively small (50,000 – 70,000 for each type of node) there will be a number of edges (relationships) between them (almost all directional).
Usefulness of pre and post order traversal of binary trees
This may be very naive, but I was wondering, it the context of binary trees (plain, sorted and balanced), of all the traversal types:
Usefulness of pre and post order traversal of binary trees
This may be very naive, but I was wondering, it the context of binary trees (plain, sorted and balanced), of all the traversal types:
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”)
Graph theory problem (name unknown)
I am trying to solve the following kind of problem. I do not know if there is already a name for this, or a solution; however, I’m willing to bet there is. I was hoping someone could point me in the direction of implementing a solution for it, or at least tell me the name of the problem?
Graph theory problem (name unknown)
I am trying to solve the following kind of problem. I do not know if there is already a name for this, or a solution; however, I’m willing to bet there is. I was hoping someone could point me in the direction of implementing a solution for it, or at least tell me the name of the problem?
Breadth-first graph search problem
I thought I was doing breadth-first graph search correctly, but my instructor’s grading script is telling me that my answer is incorrect.
Breadth-first graph search problem
I thought I was doing breadth-first graph search correctly, but my instructor’s grading script is telling me that my answer is incorrect.
Breadth-first graph search problem
I thought I was doing breadth-first graph search correctly, but my instructor’s grading script is telling me that my answer is incorrect.
What graph traversal algorithm should I use?
I would like to write an algorithm which can traverse a graph and hopefully later I can implement it to use for an indoor navigation system.
The graph would come from floor plans of a building and the graph nodes represent the building objects such as doors, corridors, stairs, rooms, etc.