- IconResource - Class in org.girod.jgraphml.model
-
An Icon resource.
- IconResource(int) - Constructor for class org.girod.jgraphml.model.IconResource
-
- IconResourceData - Class in org.girod.jgraphml.model
-
An Icon resource data.
- IconResourceData(int) - Constructor for class org.girod.jgraphml.model.IconResourceData
-
- id - Variable in class org.girod.jgraphml.model.AbstractIDElement
-
The element ID.
- ID - Static variable in interface org.girod.jgraphml.xml.XMLTags
-
The id tag.
- IDElement - Interface in org.girod.jgraphml.model
-
Reprtesrnts an element which has an ID.
- ignore_missing - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Specifies whether, for a vertex v with missing (null) distances,
v's score should ignore the missing values or be set to 'null'.
- ignore_self_distances - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer
-
Specifies whether the values returned should ignore self-distances
(distances from v to itself).
- IGraphMLNode - Interface in org.girod.jgraphml.model
-
A node interface.
- IGraphMLTemplate - Interface in org.girod.jgraphml.model.templates
-
A template element.
- IMAGE_ICON - Static variable in interface org.girod.jgraphml.xml.XMLTags
-
The yed:ImageIcon tag.
- imageTobase64(BufferedImage, String) - Static method in class org.girod.jgraphml.utils.ImageUtils
-
Convert an image to a base64 String.
- ImageUtils - Class in org.girod.jgraphml.utils
-
Utilities to convert to and from an image to a base64 String.
- ImageUtils() - Constructor for class org.girod.jgraphml.utils.ImageUtils
-
- INCIDENT - Static variable in class edu.uci.ics.jung.graph.SparseGraph
-
- IncidentEdgeIndexFunction<V,E> - Class in edu.uci.ics.jung.graph.util
-
A class which creates and maintains indices for incident edges.
- INCOMING - Static variable in class edu.uci.ics.jung.graph.SparseGraph
-
- inDegree(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- inDegree(V) - Method in interface edu.uci.ics.jung.graph.Graph
-
Returns the number of incoming edges incident to vertex.
- inDegree(V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- inDegree(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph
-
Returns the number of incoming edges incident to vertex.
- inDegree(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- inDegree(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph
-
- init(ScriptContext) - Method in interface org.girod.jgraphml.app.Script
-
Called at the initialization of the Script.
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout
-
Had to override this one as well, to ensure that setRoot() is called.
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
-
- initialize() - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
-
Initializes fields in the node that may not have
been set during the constructor.
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.StaticLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.SugiyamaLayout
-
- initialize() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
-
- initialize(Hypergraph<V, E>, Set<V>) - Method in class edu.uci.ics.jung.algorithms.path.BFSDistanceLabeler
-
- initialized - Variable in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
-
- inParentFilter(String) - Method in class org.girod.jgraphml.reader.XMLTreeWalker
-
Return true if the current node is inside the specified parent filter.
- INSETS - Static variable in interface org.girod.jgraphml.xml.XMLTags
-
The Insets tag.
- isAttr() - Method in class org.girod.jgraphml.model.KeyType
-
Return true if the key is an "attr.type" key, fals eif it is an "yfiles.typ" key.
- isAutoFlip() - Method in class org.girod.jgraphml.model.EdgeLabel.ParamModel
-
Return the auto-flip property of the model.
- isAutoRotate() - Method in class org.girod.jgraphml.model.EdgeLabel.ParamModel
-
Return the auto-rotate property of the model.
- isAutosized() - Method in class org.girod.jgraphml.model.GraphMLNode
-
Return true if the node is automatically sized depending on the node label.
- isAutosized() - Method in class org.girod.jgraphml.model.ShapeNode
-
Return true if the node is automatically sized depending on the node label.
- isCompatibleWithNode(XMLNode) - Method in class org.girod.jgraphml.reader.NodeFilter
-
Retur true if a node is comatible with the filter.
- isDefaultRatio() - Method in class org.girod.jgraphml.model.EdgeLabel.ParamModel
-
Return true if the ratio is the default ratio.
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph
-
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph
-
- isDest(V, E) - Method in interface edu.uci.ics.jung.graph.Graph
-
Returns true if vertex is the destination of edge.
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.SparseGraph
-
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph
-
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph
-
- isDest(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph
-
- isDest(IGraphMLNode, GraphMLEdge) - Method in class org.girod.jgraphml.model.AbstractGraphMLDiagram
-
Returns true if vertex is the destination of edge.
- isEmpty() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
-
Returns true if this collection contains no elements, and
false otherwise.
- isEmpty() - Method in class edu.uci.ics.jung.graph.util.Pair
-
- isEmpty() - Method in class org.girod.jgraphml.model.AbstractLabel
-
Return true if the label is empty or null.
- isEmpty() - Method in class org.girod.jgraphml.model.PortConstraints
-
Return true if there are port constraints.
- isIncident(V, E) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- isIncident(V, E) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- isIncident(V, E) - Method in interface edu.uci.ics.jung.graph.Hypergraph
-
Returns true if vertex and edge
are incident to each other.
- isIncident(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- isIncident(V, H) - Method in class edu.uci.ics.jung.graph.SetHypergraph
-
- isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
-
This one is an incremental visualization.
- isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
-
This one is an incremental visualization.
- isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
-
This one is an incremental visualization.
- isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
-
This one is an incremental visualization.
- isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
-
This one is an incremental visualization
- isInnerGraphDisplayEnabled() - Method in class org.girod.jgraphml.model.GroupStateNode
-
Return true if the inner graph display is enabled.
- isInternal(V) - Method in class edu.uci.ics.jung.graph.DelegateForest
-
computes and returns whether the passed node is
neither the root, nor a leaf node.
- isInternal(V) - Method in class edu.uci.ics.jung.graph.DelegateTree
-
Returns true if v is neither
a leaf nor the root of this tree.
- isKeepingIconAspectRatio() - Method in class org.girod.jgraphml.model.IconResource
-
Return true if the aspect ratio must be kept.
- isKeepingIconAspectRatio() - Method in class org.girod.jgraphml.model.NodeLabel
-
Return true if the icon aspect ratio must be kept.
- isLeaf(V) - Method in class edu.uci.ics.jung.graph.DelegateForest
-
Returns true if v has no child nodes.
- isLeaf(V) - Method in class edu.uci.ics.jung.graph.DelegateTree
-
Returns true if the passed node has no
children.
- isLeaf(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
Returns true if vertex is a leaf of this tree,
i.e., if it has no children.
- isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
-
- isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
-
Override to test if the passed vertex is locked in
any of the layouts.
- isLocked(V) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
-
Returns true if the position of vertex v
is locked.
- isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
-
- isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
-
- isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- isNeighbor(V, V) - Method in interface edu.uci.ics.jung.graph.Hypergraph
-
Returns true if v1 and v2 share an incident edge.
- isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.SetHypergraph
-
- ISOMLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout
-
Implements a self-organizing map layout algorithm, based on Meyer's
self-organizing graph methods.
- ISOMLayout() - Constructor for class edu.uci.ics.jung.algorithms.layout.ISOMLayout
-
Creates an instance which does not initialize the vertex locations.
- ISOMLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.ISOMLayout
-
Creates an ISOMLayout instance for the specified graph g.
- ISOMLayout.ISOMVertexData - Class in edu.uci.ics.jung.algorithms.layout
-
- ISOMVertexData() - Constructor for class edu.uci.ics.jung.algorithms.layout.ISOMLayout.ISOMVertexData
-
- isOnSegmentAutomatic() - Method in class org.girod.jgraphml.model.EdgeLabel.ParamModel
-
Set if the label is applied automatically on the best segment depending on the ratio.
- isOpened() - Method in class org.girod.jgraphml.model.GroupStateNode
-
Return true if the state is opened.
- isPredecessor(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- isPredecessor(V, V) - Method in interface edu.uci.ics.jung.graph.Graph
-
Returns true if v1 is a predecessor of v2 in this graph.
- isPredecessor(V, V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- isPredecessor(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
Returns true iff v1 is the parent of v2.
- isRoot(V) - Method in class edu.uci.ics.jung.graph.DelegateForest
-
Returns true if v has no parent node.
- isRoot(V) - Method in class edu.uci.ics.jung.graph.DelegateTree
-
computes whether the passed node is a root node
(has no children)
- isRoot(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
Returns true if vertex is a leaf of this tree,
i.e., if it has no children.
- isSmoothed() - Method in class org.girod.jgraphml.model.GraphMLEdge
-
Return true if the edge is smoothed.
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph
-
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph
-
- isSource(V, E) - Method in interface edu.uci.ics.jung.graph.Graph
-
Returns true if vertex is the source of edge.
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.SparseGraph
-
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph
-
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph
-
- isSource(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph
-
- isSource(IGraphMLNode, GraphMLEdge) - Method in class org.girod.jgraphml.model.AbstractGraphMLDiagram
-
Returns true if vertex is the source of edge.
- isSuccessor(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph
-
- isSuccessor(V, V) - Method in interface edu.uci.ics.jung.graph.Graph
-
Returns true if v1 is a successor of v2 in this graph.
- isSuccessor(V, V) - Method in class edu.uci.ics.jung.graph.GraphDecorator
-
- isSuccessor(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree
-
- isTemplate() - Method in interface org.girod.jgraphml.model.IDElement
-
Return true if this element is a template.
- isTemplate() - Method in interface org.girod.jgraphml.model.templates.IGraphMLTemplate
-
Return true.
- IterativeContext - Interface in edu.uci.ics.jung.algorithms.util
-
An interface for algorithms that proceed iteratively.
- iterator() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
-
Returns an Iterator that does not support modification
of the heap.
- iterator() - Method in class edu.uci.ics.jung.graph.util.Pair
-