Package it.unive.lisa.util.datastructures.graph
-
Interface Summary Interface Description Edge<N extends Node<N,E,G>,E extends Edge<N,E,G>,G extends Graph<G,N,E>> An edge of aGraph.GraphVisitor<G extends Graph<G,N,E>,N extends Node<N,E,G>,E extends Edge<N,E,G>,V> A visitor of aGraph.Node<N extends Node<N,E,G>,E extends Edge<N,E,G>,G extends Graph<G,N,E>> A node of aGraph. -
Class Summary Class Description AdjacencyMatrix<N extends Node<N,E,G>,E extends Edge<N,E,G>,G extends Graph<G,N,E>> AdjacencyMatrix.NodeEdges<N extends Node<N,E,G>,E extends Edge<N,E,G>,G extends Graph<G,N,E>> Utility class for representing the edges tied to a node, split into two sets: ingoing and outgoing.Graph<G extends Graph<G,N,E>,N extends Node<N,E,G>,E extends Edge<N,E,G>> A generic graph, backed by anAdjacencyMatrix.
Note that this class does not defineObject.equals(Object)norObject.hashCode(), since we leave the decision to be unique instances to implementers.