public class NoEdgeModel extends AbstractModel
Model graph without edge
Copyright: Copyright (c) 2005
Company: IST, Drexel University
name, numLabels| Constructor and Description |
|---|
NoEdgeModel(int nlabels) |
| Modifier and Type | Method and Description |
|---|---|
EdgeIterator |
getEdgeIterator() |
int |
getEdgeNum() |
int |
getEndState(int i)
Gets the index-th ending state.
|
int |
getEndStateNum() |
int |
getLabel(int state)
Gets the label of the state.
|
int |
getStartState(int i)
Gets the index-th starting state.
|
int |
getStartStateNum() |
boolean |
isEndState(int i)
Tests if the i-th state is an ending state
|
boolean |
isStartState(int i)
Tests if the i-th state is a starting state
|
getLabelNum, getMarkovOrder, getNewModelGraph, getOriginalLabelNum, getStateNum, mapLabelToState, mapLabelToState, mapStateToLabel, printGraphpublic int getEdgeNum()
public int getLabel(int state)
ModelGraphstate - the index of the statepublic int getStartStateNum()
public int getEndStateNum()
public int getStartState(int i)
ModelGraphi - the index-th starting statepublic int getEndState(int i)
ModelGraphi - the index-th ending statepublic boolean isEndState(int i)
ModelGraphi - the i-th statepublic boolean isStartState(int i)
ModelGraphi - the i-th statepublic EdgeIterator getEdgeIterator()
Copyright © 2018 JULIE Lab, Germany. All rights reserved.