graph-algorithm

I have a Location POJO that stores Location objects parsed in from a JSON file, which I want to map to a graph. Each node's location in the graph corresponds to it's id field, where id="1" is the start node and id="10" is the goal node. To solve this I adapted a Node class to include methods such as setWeight() , addChildLocation() etc , But I'm not sure how to create the graph from my list of locations. I know how to create the graph by hard coding the location's and calling addChildren, by doing the following, but not sure how to create it from a list of already available Location objects:

I have a rectangular grid shaped DAG where the horizontal edges always point right and the vertical edges always point down. The edges have positive costs associated with them. Because of the rectangular format, the nodes are being referred to using zero-based row/column. Here's an example graph: Now, I want to perform a search. The starting vertex will always be in the left column (column with index 0) and in the upper half of the graph. This means I'll pick the start to be either (0,0), (1,0), (2,0), (3,0) or (4,0). The goal vertex is always in the right column (column with index 6) and

I am looking for C++ Kruskal implementations to benchmark against my own... If you know a few good ones, please share! There's boost::kruskal_minimum_spanning_tree . Prim's algorithm is there too if you want to compare against that. 来源： https://stackoverflow.com/questions/4424512/kruskals-algorithm-in-c

This is a question in a Data Structures and Algorithm Analysis 3rd edition which was also asked in one of our exams. Write down an algorithm to topologically sort a graph represented by an adjacency list, modified such that the algorithm prints out a cycle, if it is found. First, explain your idea in a few sentences. (Don’t use depth first search, we want just a modification of the basic topological sort.) And the answer is: If no vertex has indegree 0, we can find a cycle by tracing backwards through vertices with positive indegree; since every vertex on the trace back has a positive indegree

I have a polar plane relative to a base point (colored green in the diagram below). The points and segments are represented thus: class Node { int theta; double radius; } class Segment { //each segment must have node that is northern relative to other Node northern; Node southern; } I want to figure out if the red line going from the base point to each segment node intersects any other segment. In this example, the red line does intersect. What algorithmic approach should I apply? Computational complexity is less important than simplicity of implementation. If you are striving for simplicity