public class MultiNode extends AdjacencyListNode
MultiGraphAbstractElement.AttributeChangeEvent| Constructor and Description |
|---|
MultiNode(AbstractGraph graph,
String id) |
| Modifier and Type | Method and Description |
|---|---|
<T extends Edge> |
getEdgeSetBetween(int index) |
<T extends Edge> |
getEdgeSetBetween(Node node) |
<T extends Edge> |
getEdgeSetBetween(String id) |
<T extends Node> |
getNeighborNodeIterator()
This implementation uses
AbstractNode.getEdgeIterator() and stores the
visited nodes in a set. |
getDegree, getEdge, getEdgeBetween, getEdgeFrom, getEdgeIterator, getEdgeToward, getEnteringEdge, getEnteringEdgeIterator, getInDegree, getLeavingEdge, getLeavingEdgeIterator, getOutDegreegetBreadthFirstIterator, getBreadthFirstIterator, getDepthFirstIterator, getDepthFirstIterator, getEachEdge, getEachEnteringEdge, getEachLeavingEdge, getEdgeBetween, getEdgeBetween, getEdgeFrom, getEdgeFrom, getEdgeSet, getEdgeToward, getEdgeToward, getEnteringEdgeSet, getGraph, getLeavingEdgeSet, hasEdgeBetween, hasEdgeBetween, hasEdgeBetween, hasEdgeFrom, hasEdgeFrom, hasEdgeFrom, hasEdgeToward, hasEdgeToward, hasEdgeToward, isEnteringEdge, isIncidentEdge, isLeavingEdge, iteratoraddAttribute, addAttributes, changeAttribute, clearAttributes, getArray, getAttribute, getAttribute, getAttributeCount, getAttributeKeyIterator, getAttributeKeySet, getEachAttributeKey, getFirstAttributeOf, getFirstAttributeOf, getHash, getId, getIndex, getLabel, getNumber, getVector, hasArray, hasAttribute, hasAttribute, hasHash, hasLabel, hasNumber, hasVector, removeAttribute, setAttribute, toStringequals, getClass, hashCode, notify, notifyAll, wait, wait, waitaddAttribute, addAttributes, changeAttribute, clearAttributes, getArray, getAttribute, getAttribute, getAttributeCount, getAttributeKeyIterator, getAttributeKeySet, getEachAttributeKey, getFirstAttributeOf, getFirstAttributeOf, getHash, getId, getIndex, getLabel, getNumber, getVector, hasArray, hasAttribute, hasAttribute, hasHash, hasLabel, hasNumber, hasVector, removeAttribute, setAttributepublic MultiNode(AbstractGraph graph, String id)
public <T extends Node> Iterator<T> getNeighborNodeIterator()
AbstractNodeAbstractNode.getEdgeIterator() and stores the
visited nodes in a set. In this way it ensures that each neighbor will be
visited exactly once, even in multi-graph.getNeighborNodeIterator in interface NodegetNeighborNodeIterator in class AbstractNodeNode.getNeighborNodeIterator()public <T extends Edge> Collection<T> getEdgeSetBetween(Node node)
public <T extends Edge> Collection<T> getEdgeSetBetween(String id)
public <T extends Edge> Collection<T> getEdgeSetBetween(int index)
Copyright © 2015. All rights reserved.