A B C D E G H I K L M N O P Q R S T V 

I

ignoreClass(Class) - Method in class datastructures.common.LJV.Context
Do not display any fields with this type.
ignoreField(Field) - Method in class datastructures.common.LJV.Context
Do not display this field.
ignoreField(String) - Method in class datastructures.common.LJV.Context
Do not display any fields with this name.
ignoreFields(Class) - Method in class datastructures.common.LJV.Context
Do not display any fields from this class.
ignorePackage(Package) - Method in class datastructures.common.LJV.Context
Do not display any fields that have a type from this package.
ignorePrivateFields - Variable in class datastructures.common.LJV.Context
Allow private, protected and package-access fields to be shown.
IGraph - Interface in datastructures.graph
 
IList<T> - Interface in datastructures.list
This interface defines the operations of the type List.
IMPQ<T extends ComparableModifiable<T,V>,V> - Interface in datastructures.mpq
A Modifiable Priority Queue
info() - Method in interface datastructures.graph.IGraph
Returns a string with information of the graph the string contains if the graph is directed, if is weighted, the number of vertices and the number of arcs
InfoPath - Class in datastructures.graph
This class is used to store information concerning to paths in DFS and BFS.
InfoPath(int, int) - Constructor for class datastructures.graph.InfoPath
Constructor
insert(T) - Method in interface datastructures.list.IList
Inserts a new element in the list
insert(int, T) - Method in interface datastructures.list.IList
inserts a new element in a specific position in the list
insert(T) - Method in interface datastructures.mpq.IMPQ
Inserts a new element into the Priority Queue
IQueue<T> - Interface in datastructures.queue
This interface defines the operations of the Queue data type
isDirected() - Method in interface datastructures.graph.IGraph
Returns if a vertex is directed or not
isEmpty() - Method in interface datastructures.list.IList
Checks if there are data in the list
isEmpty() - Method in interface datastructures.queue.IQueue
Checks if there are data in the queue
isEmpty() - Method in interface datastructures.stack.IStack
Checks if there are data in the stack
isFull() - Method in interface datastructures.queue.IQueue
Checks if the queue is full
isFull() - Method in interface datastructures.stack.IStack
Checks if the stack is full
IStack<T> - Interface in datastructures.stack
This interface defines the operations of the Stack data type
isWeighted() - Method in interface datastructures.graph.IGraph
Returns if a vertex is heavy or not
iterator() - Method in class datastructures.graph.Vertices
 
iterator() - Method in interface datastructures.list.IList
Returns an iterator
iterator() - Method in interface datastructures.mpq.IMPQ
Returns an iterator
iterator() - Method in interface datastructures.queue.IQueue
Returns an iterator
iterator() - Method in interface datastructures.stack.IStack
Returns an iterator
iterator() - Method in interface datastructures.tree.ITree
Returns an iterator
ITree<T> - Interface in datastructures.tree
This interface defines the operations of the ITree data type
A B C D E G H I K L M N O P Q R S T V