|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Object | +--edu.iu.iv.search.p2p.can.CanSearch
Implements the CAN Search Algorithm. Requires the network in the form of a graph object on which the search is to be performed
| Constructor Summary | |
CanSearch(edu.uci.ics.jung.graph.Graph graph)
Constructor for CanSearch algorithm. |
|
| Method Summary | |
java.lang.String |
getFailReason()
Get the reason because of which modelig failed |
edu.uci.ics.jung.graph.impl.UndirectedSparseGraph |
getGraph()
Get the graph on which search was performed |
int |
getNetworkSize()
Get size of the network |
int |
getSearchCost()
This methods returns the number of messages (i.e. |
boolean |
searchNetwork(int fromId,
int toId)
This method performs search on the graph, given the source and target nodes. |
void |
setGraph(edu.uci.ics.jung.graph.impl.UndirectedSparseGraph graph)
Set the graph to search |
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public CanSearch(edu.uci.ics.jung.graph.Graph graph)
graph - | Method Detail |
public boolean searchNetwork(int fromId,
int toId)
fromId - toId -
public int getSearchCost()
public edu.uci.ics.jung.graph.impl.UndirectedSparseGraph getGraph()
public int getNetworkSize()
public void setGraph(edu.uci.ics.jung.graph.impl.UndirectedSparseGraph graph)
graph - public java.lang.String getFailReason()
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||