Package ghidra.graph

Class DijkstraShortestPathsAlgorithmTest.CollatzGraph

java.lang.Object

ghidra.graph.DijkstraShortestPathsAlgorithmTest.CollatzGraph

All Implemented Interfaces:

GImplicitDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge>

Enclosing class:

DijkstraShortestPathsAlgorithmTest

public class DijkstraShortestPathsAlgorithmTest.CollatzGraph
extends java.lang.Object
implements GImplicitDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge>

A silly infinite graph based loosely on the Collatz conjecture

Constructor Summary

Constructors

Constructor	Description
CollatzGraph()

Method Summary

Modifier and Type	Method	Description
GDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge>	copy()	Copy some portion of the implicit graph to an explicit graph Usually, this returns the cached (explored) portion of the graph
java.util.Collection<DijkstraShortestPathsAlgorithmTest.CollatzEdge>	getInEdges(java.lang.Integer v)	Compute the incident edges that end at the given vertex (Optional operation)
java.util.Collection<DijkstraShortestPathsAlgorithmTest.CollatzEdge>	getOutEdges(java.lang.Integer v)	Compute the incident edges that start at the given vertex

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface ghidra.graph.GImplicitDirectedGraph

getPredecessors, getSuccessors

Constructor Detail

CollatzGraph

public CollatzGraph()

Method Detail

getInEdges

public java.util.Collection<DijkstraShortestPathsAlgorithmTest.CollatzEdge> getInEdges(java.lang.Integer v)

Description copied from interface: GImplicitDirectedGraph

Compute the incident edges that end at the given vertex (Optional operation)

Specified by:

getInEdges in interface GImplicitDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge>

Parameters:

v - the destination vertex

Returns:

the in-edges to the given vertex

getOutEdges

public java.util.Collection<DijkstraShortestPathsAlgorithmTest.CollatzEdge> getOutEdges(java.lang.Integer v)

Description copied from interface: GImplicitDirectedGraph

Compute the incident edges that start at the given vertex

Specified by:

getOutEdges in interface GImplicitDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge>

Parameters:

v - the source vertex

Returns:

the out-edges from the given vertex

copy

public GDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge> copy()

Description copied from interface: GImplicitDirectedGraph

Copy some portion of the implicit graph to an explicit graph Usually, this returns the cached (explored) portion of the graph

Specified by:

copy in interface GImplicitDirectedGraph<java.lang.Integer,DijkstraShortestPathsAlgorithmTest.CollatzEdge>

Returns:

a "copy" of this implicit graph