org.graphstream.graph.implementations

Class MultiNode

java.lang.Object

org.graphstream.graph.implementations.AbstractElement

org.graphstream.graph.implementations.AbstractNode

org.graphstream.graph.implementations.AdjacencyListNode

org.graphstream.graph.implementations.MultiNode

All Implemented Interfaces:

Iterable<Edge>, Element, Node

public class MultiNode
extends AdjacencyListNode

Nodes used with MultiGraph

Nested Class Summary

Nested classes/interfaces inherited from class org.graphstream.graph.implementations.AbstractElement

AbstractElement.AttributeChangeEvent

Constructor Summary

Constructors

Constructor and Description
MultiNode(AbstractGraph graph, String id)

Method Summary

Methods

Modifier and Type	Method and Description
<T extends Edge> Collection<T>	getEdgeSetBetween(int index)
<T extends Edge> Collection<T>	getEdgeSetBetween(Node node)
<T extends Edge> Collection<T>	getEdgeSetBetween(String id)
<T extends Node> Iterator<T>	getNeighborNodeIterator() This implementation uses AbstractNode.getEdgeIterator() and stores the visited nodes in a set.

Methods inherited from class org.graphstream.graph.implementations.AdjacencyListNode

getDegree, getEdge, getEdgeBetween, getEdgeFrom, getEdgeIterator, getEdgeToward, getEnteringEdge, getEnteringEdgeIterator, getInDegree, getLeavingEdge, getLeavingEdgeIterator, getOutDegree

Methods inherited from class org.graphstream.graph.implementations.AbstractNode

getBreadthFirstIterator, 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, iterator

Methods inherited from class org.graphstream.graph.implementations.AbstractElement

addAttribute, 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, toString

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.graphstream.graph.Node

toString

Methods inherited from interface org.graphstream.graph.Element

addAttribute, 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

Constructor Detail

MultiNode

public MultiNode(AbstractGraph graph,
         String id)

Method Detail

getNeighborNodeIterator

public <T extends Node> Iterator<T> getNeighborNodeIterator()

Description copied from class: AbstractNode

This implementation uses AbstractNode.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.

Specified by:

getNeighborNodeIterator in interface Node

Overrides:

getNeighborNodeIterator in class AbstractNode

Returns:

The iterator, neighbors are iterated in arbitrary order.

See Also:

Node.getNeighborNodeIterator()

getEdgeSetBetween

public <T extends Edge> Collection<T> getEdgeSetBetween(Node node)

getEdgeSetBetween

public <T extends Edge> Collection<T> getEdgeSetBetween(String id)

getEdgeSetBetween

public <T extends Edge> Collection<T> getEdgeSetBetween(int index)