GraphInfo (alto 2.2-SNAPSHOT API)

java.lang.Object
- de.up.ling.irtg.algebra.graph.GraphInfo

```
public class GraphInfo
extends Object
```
Compactly represents the information of an s-graph in a format suited for the decomposition automata. Also stores some information of the algebra itself. Usually used to represent the complete input graph.

Author:

jonas

Constructor Summary

Constructors
Constructor and Description
`GraphInfo(SGraph completeGraph, GraphAlgebra algebra)` Creates a `GraphInfo` object representing `completeGraph`, with respect to the given algebra.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int`	`dist(int vNr1, int vNr2)` Returns the distance between nodes `VNr1` and `vNr2`.
`int[]`	`getAllEdges()` Returns the array containing the IDs of all edges in the represented graph.
`int[]`	`getAllIncidentEdges(IntSet vertices)` Returns the IDs of all edges incident to any vertex in the set `vertices`.
`int`	`getDecidingEdgePWSP(int[] vSet, int v)` Returns the last edge on the shortest path from node `v` to a node in `vSet`.
`GraphEdge`	`getEdge(int edgeID)` Returns the edge corresponding to `edgeID`.
`int`	`getEdge(int source, int target)` Returns the ID of the edge with the given `source` and `target` if it exists.
`int`	`getEdgeId(GraphEdge edge)` Returns the ID for `edge`.
`int`	`getEdgeSource(int e)` Returns the source vertex of `e`.
`int`	`getEdgeTarget(int e)` Returns the target vertex of `e`.
`int[]`	`getIncidentEdges(int nodeID)` Returns the IDs of all edges incident to the node given by `nodeID`.
`int`	`getIntForNode(String nodename)` Returns the integer ID for the node with name `nodename`.
`int`	`getIntForSource(String source)` Returns the integer ID for `source`.
`int[]`	`getlabelSources(int labelId)` Returns the IDs of all sources appearing in the algebra label given by .
`int`	`getMaxDegree()` Returns the maximum degree in the represented SGraphs (loops count once).
`String`	`getNodeForInt(int nodeID)` Returns the node name corresponding to `nodeID`.
`int`	`getNrEdges()` Returns the total number of edges in the represented graph.
`int`	`getNrNodes()` Returns the total number of nodes in the represented graph.
`int`	`getNrSources()` Gives the total number of sources used in the algebra.
`int`	`getOtherNode(int e, int v)` The edge `e` has a source and a target, if `v` is one, this returns the other.
`SGraph`	`getSGraph()` Returns the represented `SGraph`.
`String`	`getSourceForInt(int sourceID)` Returns the source name corresponding to `sourceID`.
`boolean`	`isIncident(int vertex, int edge)` Returns true iff `edge` is incident to `vertex`.
`boolean`	`useBytes()` describes whether we should use shorts or bytes to represent edges and vertices (depends purely on graph size).

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - GraphInfo
```
public GraphInfo(SGraph completeGraph,
                 GraphAlgebra algebra)
```
    Creates a GraphInfo object representing completeGraph, with respect to the given algebra. Also computes distances between nodes using Floyd-Warshall , runtime O(n^3).
    
    Parameters:
    
    completeGraph -
    
    algebra -
- Method Detail
  - getIntForSource
```
public final int getIntForSource(String source)
```
    Returns the integer ID for source.
    
    Parameters:
    
    source -
    
    Returns:
  - getIntForNode
```
public int getIntForNode(String nodename)
```
    Returns the integer ID for the node with name nodename.
    
    Parameters:
    
    nodename -
    
    Returns:
  - getSourceForInt
```
public String getSourceForInt(int sourceID)
```
    Returns the source name corresponding to sourceID.
    
    Parameters:
    
    sourceID -
    
    Returns:
  - getNodeForInt
```
public String getNodeForInt(int nodeID)
```
    Returns the node name corresponding to nodeID.
    
    Parameters:
    
    nodeID -
    
    Returns:
  - getNrSources
```
public int getNrSources()
```
    Gives the total number of sources used in the algebra.
    
    Returns:
  - getAllIncidentEdges
```
public int[] getAllIncidentEdges(IntSet vertices)
```
    Returns the IDs of all edges incident to any vertex in the set vertices.
    
    Parameters:
    
    vertices -
    
    Returns:
  - getIncidentEdges
```
public int[] getIncidentEdges(int nodeID)
```
    Returns the IDs of all edges incident to the node given by nodeID.
    
    Parameters:
    
    nodeID -
    
    Returns:
  - getNrNodes
```
public final int getNrNodes()
```
    Returns the total number of nodes in the represented graph.
    
    Returns:
  - getlabelSources
```
public int[] getlabelSources(int labelId)
```
    Returns the IDs of all sources appearing in the algebra label given by .
    
    Parameters:
    
    labelId -
    
    Returns:
  - getNrEdges
```
public final int getNrEdges()
```
    Returns the total number of edges in the represented graph.
    
    Returns:
  - isIncident
```
public final boolean isIncident(int vertex,
                                int edge)
```
    Returns true iff edge is incident to vertex.
    
    Parameters:
    
    vertex -
    
    edge -
    
    Returns:
  - getEdgeId
```
public int getEdgeId(GraphEdge edge)
```
    Returns the ID for edge.
    
    Parameters:
    
    edge -
    
    Returns:
  - getAllEdges
```
public final int[] getAllEdges()
```
    Returns the array containing the IDs of all edges in the represented graph.
    
    Returns:
  - getOtherNode
```
public int getOtherNode(int e,
                        int v)
```
    The edge e has a source and a target, if v is one, this returns the other. Otherwise, i.e. if e is not incident to v, this returns -1.
    
    Parameters:
    
    e -
    
    v -
    
    Returns:
  - getEdgeSource
```
public int getEdgeSource(int e)
```
    Returns the source vertex of e.
    
    Parameters:
    
    e -
    
    Returns:
  - getEdgeTarget
```
public int getEdgeTarget(int e)
```
    Returns the target vertex of e.
    
    Parameters:
    
    e -
    
    Returns:
  - getEdge
```
public int getEdge(int source,
                   int target)
```
    Returns the ID of the edge with the given source and target if it exists. Otherwise returns -1.
    
    Parameters:
    
    source -
    
    target -
    
    Returns:
  - getEdge
```
public GraphEdge getEdge(int edgeID)
```
    Returns the edge corresponding to edgeID.
    
    Parameters:
    
    edgeID -
    
    Returns:
  - getSGraph
```
public SGraph getSGraph()
```
    Returns the represented SGraph.
    
    Returns:
  - getMaxDegree
```
public int getMaxDegree()
```
    Returns the maximum degree in the represented SGraphs (loops count once).
    
    Returns:
  - useBytes
```
public boolean useBytes()
```
    describes whether we should use shorts or bytes to represent edges and vertices (depends purely on graph size).
    
    Returns:
  - getDecidingEdgePWSP
```
public int getDecidingEdgePWSP(int[] vSet,
                               int v)
```
    Returns the last edge on the shortest path from node v to a node in vSet. Uses the previously stored information computed via Floyd-Warshall. Runtime is linear in the size of vSet.
    
    Parameters:
    
    vSet -
    
    v -
    
    Returns:
  - dist
```
public int dist(int vNr1,
                int vNr2)
```
    Returns the distance between nodes VNr1 and vNr2. Precomputed via Floyd-Warshall, has constant runtime.
    
    Parameters:
    
    vNr1 -
    
    vNr2 -
    
    Returns:

Class GraphInfo

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

GraphInfo

Method Detail

getIntForSource

getIntForNode

getSourceForInt

getNodeForInt

getNrSources

getAllIncidentEdges

getIncidentEdges

getNrNodes

getlabelSources

getNrEdges

isIncident

getEdgeId

getAllEdges

getOtherNode

getEdgeSource

getEdgeTarget

getEdge

getEdge

getSGraph

getMaxDegree

useBytes

getDecidingEdgePWSP

dist