Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.attribute(M attribute) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.bothArrow(G object,
M attribute) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.concept(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.dehighlight() |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.downArrow(G object,
M attribute) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.filter(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.ideal(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.implication(de.tudresden.inf.tcs.fcalib.Implication<M> implication) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.incidence(G object,
M attribute) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.interval(Concept<G,M> lowerConcept,
Concept<G,M> upperConcept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.lowerNeighbors(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.nonIncidence(G object,
M attribute) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.object(G object) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.strictFilter(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.strictIdeal(Concept<G,M> concept) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.upArrow(G object,
M attribute) |
Iterable<Graph.HighlightRequest> |
ConceptGraph.HighlightRequests.upperNeighbors(Concept<G,M> concept) |