Package | Description |
---|---|
org.anchoranalysis.core.graph |
Data-structures for directed and undirected graphs, with or without an edge payload.
|
org.anchoranalysis.mpp.feature.addcriteria |
Criteria for adding edges during optimization of marked-point-processes.
|
org.anchoranalysis.plugin.image.object.merge |
Merging
ObjectMask s. |
Modifier and Type | Method and Description |
---|---|
Collection<TypedEdge<V,P>> |
GraphWithPayload.edgesMaybeDuplicates()
The edges in the graph, all of them, but with some edges possibly duplicated.
|
Set<TypedEdge<V,P>> |
GraphWithPayload.edgesUnique()
The edges in the graph, all of them, without any duplicates.
|
Collection<TypedEdge<V,P>> |
GraphWithPayload.outgoingEdgesFor(V vertex)
All outgoing edges for a given vertex.
|
Modifier and Type | Method and Description |
---|---|
Collection<TypedEdge<Mark,T>> |
RandomCollectionWithAddCriteria.getPairsFor(Mark mark) |
Modifier and Type | Method and Description |
---|---|
TypedEdge<ObjectVertex,PrioritisedVertex> |
MergeGraph.findMaxPriority() |
Modifier and Type | Method and Description |
---|---|
void |
GraphLogger.describeMerge(ObjectVertex omMerged,
TypedEdge<ObjectVertex,PrioritisedVertex> bestImprovement) |
String |
DescribeGraph.describeMerge(ObjectVertex omMerged,
TypedEdge<ObjectVertex,PrioritisedVertex> bestImprovement) |
ObjectVertex |
MergeGraph.merge(TypedEdge<ObjectVertex,PrioritisedVertex> bestImprovement) |
Copyright © 2010–2023 Owen Feehan, ETH Zurich, University of Zurich, Hoffmann-La Roche. All rights reserved.