Package | Description |
---|---|
conexp.fx.core.algorithm.lattice | |
conexp.fx.core.algorithm.nextclosure | |
conexp.fx.core.layout | |
conexp.fx.gui.dataset | |
conexp.fx.gui.graph | |
conexp.fx.gui.graph.option |
Modifier and Type | Method and Description |
---|---|
static <G,M> ConceptLattice<G,M> |
IPred.getConceptLattice(MatrixContext<G,M> cxt,
Set<Concept<G,M>> concepts) |
Modifier and Type | Method and Description |
---|---|
static <G,M> TimeTask<Void> |
IPred.neighborhood(String id,
ConceptLattice<G,M> lattice) |
static <G,M> void |
IPred.populateConceptLattice(ConceptLattice<G,M> lattice,
Consumer<String> messageConsumer,
Consumer<Double> statusConsumer,
Supplier<Boolean> isCancelled) |
Modifier and Type | Method and Description |
---|---|
static <G,M> TimeTask<Void> |
NextConcept.concepts(ConceptLattice<G,M> lattice) |
Modifier and Type | Field and Description |
---|---|
ConceptLattice<G,M> |
ConceptLayout.lattice |
Constructor and Description |
---|
AdditiveConceptLayout(ConceptLattice<G,M> conceptLattice,
@Nullable Map<G,javafx.geometry.Point3D> initialSeedsG,
@Nullable Map<M,javafx.geometry.Point3D> initialSeedsM,
AdditiveConceptLayout.Type type) |
ConceptLayout(ConceptLattice<G,M> conceptLattice) |
SimpleConceptLayout(ConceptLattice<G,M> conceptLattice) |
Modifier and Type | Field and Description |
---|---|
ConceptLattice<G,M> |
FCADataset.lattice |
Constructor and Description |
---|
CircularGraph(ConceptLattice<G,M> lattice) |
PolarGraph(ConceptLattice<G,M> lattice) |
Modifier and Type | Method and Description |
---|---|
abstract <G,M> String |
AttributeLabelText.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Concept<G,M> concept) |
abstract <G,M> String |
ObjectLabelText.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Concept<G,M> concept) |
abstract <G,M> double |
VertexRadius.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Concept<G,M> concept) |
abstract <G,M> double |
EdgeStroke.get(Context<G,M> context,
ConceptLattice<G,M> lattice,
Pair<Concept<G,M>,Concept<G,M>> concepts) |
Copyright © 2010–2023 Francesco Kriegel. All rights reserved.