Uses of Class com.port80.graph.dot.impl.DotVertex

Overview

Package

Class

Use

Deprecated

Index

Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ]

PREV NEXT

Uses of Class
com.port80.graph.dot.impl.DotVertex

Uses of DotVertex in com.port80.graph.dot.impl

Fields in com.port80.graph.dot.impl declared as DotVertex

private DotVertex[] NetworkSimplex.grVertices


private DotVertex[] NetworkSimplex.treeVts
          All input graph vertices.

private DotVertex NetworkSimplex.cutChild


private DotVertex[] DotGraph.fVertices


protected DotVertex DotEdge.head


protected DotVertex DotEdge.tail

Methods in com.port80.graph.dot.impl that return DotVertex

private DotVertex Position.createDotVertex(VirtualVertex v)


private DotVertex Position.createDotVertex(VirtualEdge e)
          Auxillary vertex that split the given VirtualEdge.

private DotVertex NetworkSimplex.incident(DotEdge e)


private DotVertex NetworkSimplex.treeUpdate(DotVertex v, DotVertex w, int cutvalue, boolean fromtail)
          Walk up from v to LCA(v,w), setting new cut values.

DotVertex[] DotGraph.getVertices()


DotVertex DotEdge.getHead()


DotVertex DotEdge.getTail()


DotVertex DotEdge.getOpposite(DotVertex v)

Methods in com.port80.graph.dot.impl with parameters of type DotVertex

private DotEdge Position.createDotEdge(DotVertex head, DotVertex tail, int minlen, int weight)


private boolean NetworkSimplex.treeSearch(DotVertex v)
          Find tree edges started from v outward that have slack==0.

private void NetworkSimplex.dfCutValue(DotVertex v, DotEdge parent)
          Calculate cut value of edges in a tree from bottom up.

private void NetworkSimplex.dfEnterOutEdge(DotVertex v)
          Find an non-tree edge with minimum slack going from head component to the tail component.

private void NetworkSimplex.dfEnterInEdge(DotVertex v)
          Find an non-tree edge with minimum slack going from head component to the tail component.

private DotVertex NetworkSimplex.treeUpdate(DotVertex v, DotVertex w, int cutvalue, boolean fromtail)
          Walk up from v to LCA(v,w), setting new cut values.

private void NetworkSimplex.rerank(DotVertex v, int delta)
          Adjust ranks of subtree at v by -delta.

boolean DotVertex.isDecendent(DotVertex v)


private void DotGraph.initEdges(DotVertex dotv, java.util.List in, java.util.List out)


private void DotGraph.minMaxRanked(DotVertex[] vts)
          Reverse edges for min/max ranked vertex so ranking would put them into the right rank.

private java.util.List DotGraph.decompose(DotVertex start, java.util.Set visited, java.util.List ret)
          Perform a bidirectional depth first search from the starting vertex to all vertices connected on the same island.

private int DotGraph.acyclic(DotVertex[] vts)
          Make graph acyclic by reversing edges that points back to an ancestor in a depth first search.

private int DotGraph.acyclic(DotVertex[] vts, int start, boolean doreverse)


private void DotGraph.acyclic(DotVertex start, java.util.Set visited, java.util.Set ancestors, java.util.Set reversed, DotGraph.AcyclicData data)


private boolean DotGraph.checkAcyclic(DotVertex v, java.util.Set visited, java.util.Set ancestors)
          Check that graph is acyclic.

private int DotEdge.xValue(DotVertex v, boolean tailside)
          Determine xValue of an edge depending on its edge type.

DotVertex DotEdge.getOpposite(DotVertex v)

Constructors in com.port80.graph.dot.impl with parameters of type DotVertex

DotGraph(java.lang.String name, DotVertex[] vlist)


DotEdge(DotVertex head, DotVertex tail, int minlen, int weight)


DotEdge(DotVertex head, DotVertex tail, com.port80.graph.IEdge e)