Uses of Interface
de.aitools.aq.graph.weighted.UndirectedMutableGraph

Packages that use UndirectedMutableGraph
de.aitools.aq.graph.weighted.concrete   
de.aitools.aq.graph.weighted.util   
de.aitools.dm.clustering.algorithms.dbscan   
 

Uses of UndirectedMutableGraph in de.aitools.aq.graph.weighted.concrete
 

Classes in de.aitools.aq.graph.weighted.concrete that implement UndirectedMutableGraph
 class ComparablesUndirectedGraph<V>
          Deprecated. see package de.aitools.aq.structure.graph
 class GeneralUndirectedGraph<V>
          Deprecated. see package de.aitools.aq.structure.graph
 

Uses of UndirectedMutableGraph in de.aitools.aq.graph.weighted.util
 

Methods in de.aitools.aq.graph.weighted.util that return UndirectedMutableGraph
static
<V> UndirectedMutableGraph<V>
KNNGraph.createUndirectedKNNGraph(Vector[] data, V[] vertices, java.util.Comparator<V> vertexComparator, Proximity<Vector> proximity, int k)
          Deprecated. Create an undirected K-Nearest-Neighbor-Graph.
static
<V> UndirectedMutableGraph<V>
KNNGraph.createUndirectedKNNGraph(Vector[] data, V[] vertices, java.util.Comparator<V> vertexComparator, Proximity<Vector> proximity, int k, double noEdgeWeight)
          Deprecated. Create an undirected K-Nearest-Neighbor-Graph.
 

Uses of UndirectedMutableGraph in de.aitools.dm.clustering.algorithms.dbscan
 

Methods in de.aitools.dm.clustering.algorithms.dbscan that return UndirectedMutableGraph
static UndirectedMutableGraph<Point> ProximitySorter.neighborGraph(Vector[] data, Proximity<Vector> proximityMeasure, int numNeighbors)
           
 

Methods in de.aitools.dm.clustering.algorithms.dbscan with parameters of type UndirectedMutableGraph
 double Point.getProximityToNThNeighbor(int n, UndirectedMutableGraph<Point> neighborGraph)
          TODO
static double[][] ProximitySorter.getSortedProximities(UndirectedMutableGraph<Point> neighborGraph, int minNeighbor, int stepWidth, int numSteps)
           
 boolean Point.isBorderPoint(UndirectedMutableGraph<Point> neighborGraph, int coreMinNeighbors)
          TODO
 boolean Point.isCorePoint(UndirectedMutableGraph<Point> neighborGraph, int coreMinNeighbors)
          TODO
 boolean Point.isNoisePoint(UndirectedMutableGraph<Point> neighborGraph, int coreMinNeighbors)
          TODO