graph
Class AdjacencyMatrixGraph
java.lang.Object
graph.Graph
graph.AdjacencyMatrixGraph
- Direct Known Subclasses:
- ListColoredAdjacencyMatrixGraph
public class AdjacencyMatrixGraph
- extends Graph
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
AdjacencyMatrixGraph
public AdjacencyMatrixGraph()
AdjacencyMatrixGraph
public AdjacencyMatrixGraph(int n)
AdjacencyMatrixGraph
public AdjacencyMatrixGraph(int n,
double p)
AdjacencyMatrixGraph
public AdjacencyMatrixGraph(int n,
int m)
AdjacencyMatrixGraph
public AdjacencyMatrixGraph(java.io.File f)
getNodeForId
public int getNodeForId(int i)
getNodeForId
public int getNodeForId(java.lang.String name)
areAdjacent
public boolean areAdjacent(int u,
int v)
- Description copied from class:
Graph
- Tests whether two vertices are adjacent
- Specified by:
areAdjacent
in class Graph
- Parameters:
u
- the first vertexv
- the second vertex
edgeNum
public int edgeNum()
- Specified by:
edgeNum
in class Graph
vertexNum
public int vertexNum()
- Specified by:
vertexNum
in class Graph
insertEdge
public void insertEdge(int i,
int j)
toString
public java.lang.String toString()
- Overrides:
toString
in class java.lang.Object
copyGraph
public AdjacencyMatrixGraph copyGraph()
copyGraph
public AdjacencyMatrixGraph copyGraph(int addVerts)
setStringMap
public void setStringMap(java.util.HashMap<java.lang.String,java.lang.Integer> map)
setBackMap
public void setBackMap(java.util.HashMap<java.lang.Integer,java.lang.String> map)
getVertexString
public java.lang.String getVertexString(int i)
getStringMap
public java.util.HashMap<java.lang.String,java.lang.Integer> getStringMap()
inducedGraphVertexDel
public AdjacencyMatrixGraph inducedGraphVertexDel(java.util.Set<java.lang.Integer> del)