Uses of Class
org.thegalactic.dgraph.Node

Packages that use Node

Package	Description
org.thegalactic.context	This package is designed to represent contexts.
org.thegalactic.dgraph	This package is designed to represent directed graph.
org.thegalactic.lattice	This package is designed to represent lattice.

Uses of Node in org.thegalactic.context

Methods in org.thegalactic.context that return types with arguments of type Node

Modifier and Type	Method and Description
TreeSet<Node>	Context.getDivisionConvex(Context ctx) Returns a convex set of the concept lattice of c which can be doubled to recover the concept lattice of this component.

Uses of Node in org.thegalactic.dgraph

Methods in org.thegalactic.dgraph that return Node

Modifier and Type	Method and Description
Node	Node.clone() Returns a clone of this node.
Node<N>	ConcreteDGraph.getNode(Node<N> search) Returns the node that is equal to the specified one.
Node<N>	ConcreteDGraph.getNodeByContent(Object content) Returns the node whose content is equal to the specified one.
Node<N>	ConcreteDGraph.getNodeByIdentifier(int identifier) Returns the node whose ident is equal to the specified one.
Node<N>	Edge.getSource() Returns the source node of this edge.
Node<N>	Edge.getTarget() Returns the target node of this edge.
Node	Node.setContent(N content) Set the content.

Methods in org.thegalactic.dgraph that return types with arguments of type Node

Modifier and Type	Method and Description
SortedSet<Node<N>>	DGraph.getNodes() Returns the set of nodes of this component.
SortedSet<Node<N>>	ConcreteDGraph.getNodes() Returns the set of nodes of this component.
SortedSet<Node<N>>	DGraph.getPredecessorNodes(Node<N> node) Returns the set of nodes predecessors of the specified node.
SortedSet<Node<N>>	ConcreteDGraph.getPredecessorNodes(Node<N> node) Returns the set of nodes predecessors of the specified node.
protected TreeMap<Node<N>,TreeSet<Edge<N,E>>>	ConcreteDGraph.getPredecessors() Returns the predecessors of this component.
SortedSet<Node<N>>	DGraph.getSinks() Returns the sinks of this component.
SortedSet<Node<N>>	AbstractDGraph.getSinks() Returns the sinks of this component.
DAGraph<SortedSet<Node<N>>,Object>	ConcreteDGraph.getStronglyConnectedComponent() Returns the directed acyclic graph where each node corresponds to a strongly connected component (SCC) of this component stored in a TreeSet of nodes.
SortedSet<Node<N>>	DGraph.getSuccessorNodes(Node<N> node) Returns the set of nodes successors of the specified node.
SortedSet<Node<N>>	ConcreteDGraph.getSuccessorNodes(Node<N> node) Returns the set of nodes successors of the specified node.
protected TreeMap<Node<N>,TreeSet<Edge<N,E>>>	ConcreteDGraph.getSuccessors() Returns the successors of this component.
SortedSet<Node<N>>	DGraph.getWells() Returns the wells of this component.
SortedSet<Node<N>>	AbstractDGraph.getWells() Returns the wells of this component.
SortedSet<Node<N>>	DAGraph.majorants(Node<N> node) Returns the set of majorants of the specified node.
SortedSet<Node<N>>	DAGraph.max() Returns the maximal elements of this component.
SortedSet<Node<N>>	DAGraph.min() Returns the minimal elements of this component.
SortedSet<Node<N>>	DAGraph.minorants(Node<N> node) Returns the set of minorants of the specified node.
List<Node<N>>	AbstractDGraph.topologicalSort() Returns a topological sort of the node of this component.

Methods in org.thegalactic.dgraph with parameters of type Node

Modifier and Type	Method and Description
boolean	ConcreteDGraph.addEdge(Node<N> source, Node<N> target) Adds an edge between the specified nodes to this component: to is added as a successor of source.
boolean	ConcreteDGraph.addEdge(Node<N> source, Node<N> target) Adds an edge between the specified nodes to this component: to is added as a successor of source.
boolean	ConcreteDGraph.addEdge(Node<N> source, Node<N> target, Object content) Adds an edge between the specified nodes to this component: to is added as a successor of source.
boolean	ConcreteDGraph.addEdge(Node<N> source, Node<N> target, Object content) Adds an edge between the specified nodes to this component: to is added as a successor of source.
boolean	ConcreteDGraph.addNode(Node<N> node) Adds the specified node to the set of node of this component.
int	Node.compareTo(Node node) Compares this node with those in parameter, based on their identifiers.
boolean	ConcreteDGraph.containsEdge(Node<N> source, Node<N> target) Checks if there exists an edge between the two specified nodes.
boolean	ConcreteDGraph.containsEdge(Node<N> source, Node<N> target) Checks if there exists an edge between the two specified nodes.
boolean	ConcreteDGraph.containsNode(Node<N> node) Checks if the specified node belong to this component.
DAGraph<N,E>	DAGraph.filter(Node<N> node) Returns the subgraph induced by the specified node and its successors in the transitive closure.
Edge<N,E>	ConcreteDGraph.getEdge(Node<N> source, Node<N> target) Returns, if it exists, the edge between node source and node to.
Edge<N,E>	ConcreteDGraph.getEdge(Node<N> source, Node<N> target) Returns, if it exists, the edge between node source and node to.
Node<N>	ConcreteDGraph.getNode(Node<N> search) Returns the node that is equal to the specified one.
SortedSet<Edge<N,E>>	DGraph.getPredecessorEdges(Node<N> node) Returns the set of edges predecessors of the specified node.
SortedSet<Edge<N,E>>	ConcreteDGraph.getPredecessorEdges(Node<N> node) Returns the set of edges predecessors of the specified node.
SortedSet<Node<N>>	DGraph.getPredecessorNodes(Node<N> node) Returns the set of nodes predecessors of the specified node.
SortedSet<Node<N>>	ConcreteDGraph.getPredecessorNodes(Node<N> node) Returns the set of nodes predecessors of the specified node.
SortedSet<Edge<N,E>>	DGraph.getSuccessorEdges(Node<N> node) Returns the set of edges successors of the specified node.
SortedSet<Edge<N,E>>	ConcreteDGraph.getSuccessorEdges(Node<N> node) Returns the set of edges successors of the specified node.
SortedSet<Node<N>>	DGraph.getSuccessorNodes(Node<N> node) Returns the set of nodes successors of the specified node.
SortedSet<Node<N>>	ConcreteDGraph.getSuccessorNodes(Node<N> node) Returns the set of nodes successors of the specified node.
DAGraph<N,E>	DAGraph.ideal(Node<N> node) Returns the subgraph induced by the specified node and its predecessors in the transitive closure.
SortedSet<Node<N>>	DAGraph.majorants(Node<N> node) Returns the set of majorants of the specified node.
SortedSet<Node<N>>	DAGraph.minorants(Node<N> node) Returns the set of minorants of the specified node.
boolean	ConcreteDGraph.removeEdge(Node<N> source, Node<N> target) Removes source this component the edge between the specified node.
boolean	ConcreteDGraph.removeEdge(Node<N> source, Node<N> target) Removes source this component the edge between the specified node.
boolean	ConcreteDGraph.removeNode(Node<N> node) Removes the specified node from this component.

Method parameters in org.thegalactic.dgraph with type arguments of type Node

Modifier and Type	Method and Description
DAGraph<N,E>	DAGraph.getSubgraphByNodes(Set<Node<N>> nodes) Returns the subgraph of this component induced by the specified set of nodes.
ConcreteDGraph<N,E>	ConcreteDGraph.getSubgraphByNodes(Set<Node<N>> nodes) Returns the subgraph of this component induced by the specified set of nodes.
boolean	ConcreteDGraph.removeNodes(Set<Node<N>> nodes) Removes the specified set of nodes from this component.
protected ConcreteDGraph<N,E>	ConcreteDGraph.setNodes(TreeSet<Node<N>> nodes) Set the set of nodes of this component.
protected ConcreteDGraph<N,E>	ConcreteDGraph.setPredecessors(TreeMap<Node<N>,TreeSet<Edge<N,E>>> predecessors) Set the predecessors of this component.
protected ConcreteDGraph<N,E>	ConcreteDGraph.setSuccessors(TreeMap<Node<N>,TreeSet<Edge<N,E>>> successors) Set the successors of this component.

Constructors in org.thegalactic.dgraph with parameters of type Node

Constructor and Description
Edge(Node<N> source, Node<N> target) Constructs a new edge with the specified node as origin and destination node, and a null value as content.
Edge(Node<N> source, Node<N> target) Constructs a new edge with the specified node as origin and destination node, and a null value as content.
Edge(Node<N> source, Node<N> target, E content) Constructs a new edge with the specified node as origin and destination node, with the specified content.
Edge(Node<N> source, Node<N> target, E content) Constructs a new edge with the specified node as origin and destination node, with the specified content.

Constructor parameters in org.thegalactic.dgraph with type arguments of type Node

Constructor and Description
ConcreteDGraph(SortedSet<Node<N>> set) Constructs a new directed graph source the specified set of nodes.
DAGraph(SortedSet<Node<N>> set) Constructs this component with the specified set of nodes, and empty treemap of successors and predecessors.

Uses of Node in org.thegalactic.lattice

Subclasses of Node in org.thegalactic.lattice

Modifier and Type	Class and Description
class	Concept This class gives a representation for a concept, i.e.

Methods in org.thegalactic.lattice that return Node

Modifier and Type	Method and Description
Node<N>	Lattice.bottom() Returns the bottom of the lattice.
Node<N>	Lattice.join(Node<N> x, Node<N> y) Returns the join of the two specified nodes if it exists.
Node<N>	Lattice.meet(Node<N> x, Node<N> y) Returns the meet of the two specified nodes if it exists.
Node<N>	Lattice.top() Returns the top of the lattice.

Methods in org.thegalactic.lattice that return types with arguments of type Node

Modifier and Type	Method and Description
TreeSet<Node<N>>	Lattice.joinIrreducibles() Returns the set of join irreducibles of this component.
TreeSet<Node<N>>	Lattice.joinIrreducibles(Node<N> node) Returns the set of join-irreducibles that are minorants of the specified node.
TreeSet<Node<N>>	Lattice.meetIrreducibles() Returns the set of meet irreducibles of this component.
TreeSet<Node<N>>	Lattice.meetIrreducibles(Node<N> node) Returns the set of meet-irreducibles thar are majorants of the specified node.

Methods in org.thegalactic.lattice with parameters of type Node

Modifier and Type	Method and Description
Vector<TreeSet<Comparable>>	ConceptLattice.immediateSuccessors(Node n, ClosureSystem init) Returns the list of immediate successors of a given node of the lattice.
Node<N>	Lattice.join(Node<N> x, Node<N> y) Returns the join of the two specified nodes if it exists.
Node<N>	Lattice.join(Node<N> x, Node<N> y) Returns the join of the two specified nodes if it exists.
TreeSet<Node<N>>	Lattice.joinIrreducibles(Node<N> node) Returns the set of join-irreducibles that are minorants of the specified node.
Node<N>	Lattice.meet(Node<N> x, Node<N> y) Returns the meet of the two specified nodes if it exists.
Node<N>	Lattice.meet(Node<N> x, Node<N> y) Returns the meet of the two specified nodes if it exists.
TreeSet<Node<N>>	Lattice.meetIrreducibles(Node<N> node) Returns the set of meet-irreducibles thar are majorants of the specified node.

Constructor parameters in org.thegalactic.lattice with type arguments of type Node

Constructor and Description
Lattice(SortedSet<Node<N>> set) Constructs this component with the specified set of nodes, and empty treemap of successors and predecessors.