Uses of Class
jdg.graph.AdjacencyListGraph
Packages that use AdjacencyListGraph
-
Uses of AdjacencyListGraph in Unnamed Package
Fields in Unnamed Package declared as AdjacencyListGraphModifier and TypeFieldDescriptionFR91Layout.gInput graph to drawPlanarLayout.gInput graph to draw: no combinatorial embedding provided (only the 1-skeleton of the graph)static AdjacencyListGraphSpringDrawing.inputGraphinput graph to drawConstructors in Unnamed Package with parameters of type AdjacencyListGraphModifierConstructorDescriptionFR91Layout(AdjacencyListGraph g, double w, double h) Initialize the parameters of the force-directed method, according to the original FR91 algorithmInitialize the drawing: by the default all vertices are placed at the origin (0.0, 0.0) -
Uses of AdjacencyListGraph in jdg.graph
Methods in jdg.graph that return AdjacencyListGraphModifier and TypeMethodDescriptionstatic AdjacencyListGraphGraphAlgorithms.extractComponent(AdjacencyListGraph g1, int indexU, AdjacencyListGraph g2) Given two input graphs G1, G2 and a vertex U, extract a sub-graph from g2 as defined belowstatic AdjacencyListGraphGraphAlgorithms.extractSubGraph(AdjacencyListGraph g, boolean[] vertexExists) Given an input graph G, extract and return (a copy of) the induced sub-graph G', having a given sub-set of verticesMethods in jdg.graph with parameters of type AdjacencyListGraphModifier and TypeMethodDescriptionstatic AdjacencyListGraphGraphAlgorithms.extractComponent(AdjacencyListGraph g1, int indexU, AdjacencyListGraph g2) Given two input graphs G1, G2 and a vertex U, extract a sub-graph from g2 as defined belowstatic AdjacencyListGraphGraphAlgorithms.extractSubGraph(AdjacencyListGraph g, boolean[] vertexExists) Given an input graph G, extract and return (a copy of) the induced sub-graph G', having a given sub-set of vertices -
Uses of AdjacencyListGraph in jdg.io
Methods in jdg.io that return AdjacencyListGraphModifier and TypeMethodDescriptionstatic AdjacencyListGraphRead a graph stored in MTX format Remark: nodes have indices between 1..n