Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>This simple solution returns all the paths.</p> <p>It works also with cyclic graphs, printing all cycling paths, hence it can be used also for cycle detection, which is not available in JUNG.</p> <p>It uses an arbitrary class <code>Entity</code> for the nodes, and <code>Edge</code> for the edges. You can create such objects (make sure to implement <code>hashcode()</code> and <code>equals()</code>), or simply substitute them with <code>String</code> objects, depending on your needs.</p> <pre><code>public class AllPaths { private static List&lt;List&lt;Edge&gt;&gt; allPaths; public static List&lt;List&lt;Edge&gt;&gt; getAllPathsBetweenNodes(DirectedGraph&lt;Entity, Edge&gt; graph, Entity startNode, Entity endNode) { allPaths = new ArrayList&lt;List&lt;Edge&gt;&gt;(); List&lt;Edge&gt; currentPath = new ArrayList&lt;Edge&gt;(); findAllPaths(startNode, startNode, endNode, currentPath, graph); return allPaths; } private static void findAllPaths(Entity currentNode, Entity startNode, Entity endNode, List&lt;Edge&gt; currentPath, DirectedGraph&lt;Entity, Edge&gt; graph) { Collection&lt;Edge&gt; outgoingEdges = graph.getOutEdges(currentNode); for (Edge outEdge : outgoingEdges) { Entity outNode = outEdge.getSupertype(); if (outNode.equals(startNode)) { List&lt;Edge&gt; cyclePath = new ArrayList&lt;Edge&gt;(currentPath); cyclePath.add(outEdge); System.out.println("Found cycle provoked by path " + cyclePath); continue; } List&lt;Edge&gt; newPath = new ArrayList&lt;Edge&gt;(currentPath); newPath.add(outEdge); if (outNode.equals(endNode)) { allPaths.add(newPath); continue; } findAllPaths(outNode, startNode, endNode, newPath, graph); } } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POFinding all paths in JUNG?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USAlphaaa
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COI found a bug in my own algorithm. The method findAllPaths() should return null immediately if `currentNode` has already been visited. Hence it is sufficient to store a `Set` of visited nodes and read it to fix the bug.
      singulars
      1. PO
      1. USAlphaaa
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload