Package gov.nih.mipav.view.renderer.WildMagic.Knees

Class WeakConnectedEdgePatternVertical

java.lang.Object

gov.nih.mipav.view.renderer.WildMagic.Knees.PatternDetection

gov.nih.mipav.view.renderer.WildMagic.Knees.WeakConnectedEdgePatternVertical

public class WeakConnectedEdgePatternVertical
extends PatternDetection

Field Summary

Fields inherited from class gov.nih.mipav.view.renderer.WildMagic.Knees.PatternDetection

colNumber, rowNumber

Constructor Summary

Constructors

Constructor	Description
WeakConnectedEdgePatternVertical()

Method Summary

Modifier and Type	Method	Description
(package private) void	DFS_searchOnBottom(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2, boolean[][] visited, int yDelimiter)
(package private) void	DFS_searchOnTop(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2, boolean[][] visited, int yDelimiter)
int	findWeakEdge(int[][] map, int startX, int startY, int xDim, int yDim, int range)
(package private) boolean	isSafe_searchOnBottom(int[][] map, int x, int y, int xDim, int yDim, boolean[][] visited, int yDelimiter)
(package private) boolean	isSafe_searchOnTop(int[][] map, int x, int y, int xDim, int yDim, boolean[][] visited, int yDelimiter)
void	printMapOnBottom(int[][] map, int x, int y, int xDim, int yDim)
void	printMapOnTop(int[][] map, int x, int y, int xDim, int yDim)
void	printVisitedMapOnBottom(boolean[][] map, int x, int y, int xDim, int yDim)
void	printVisitedMapOnTop(boolean[][] map, int x, int y, int xDim, int yDim)
(package private) int	searchOnBottom(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2)
(package private) int	searchOnTop(int[][] map, int x, int y, int xDim, int yDim, int[] x1, int[] x2, int[] y1, int[] y2)
int	test()

Methods inherited from class gov.nih.mipav.view.renderer.WildMagic.Knees.PatternDetection

DFS, isSafe, printMap, printVisitedMap

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

WeakConnectedEdgePatternVertical

public WeakConnectedEdgePatternVertical()

Method Detail

findWeakEdge

public int findWeakEdge(int[][] map,
                        int startX,
                        int startY,
                        int xDim,
                        int yDim,
                        int range)

searchOnBottom

int searchOnBottom(int[][] map,
                   int x,
                   int y,
                   int xDim,
                   int yDim,
                   int[] x1,
                   int[] x2,
                   int[] y1,
                   int[] y2)

DFS_searchOnBottom

void DFS_searchOnBottom(int[][] map,
                        int x,
                        int y,
                        int xDim,
                        int yDim,
                        int[] x1,
                        int[] x2,
                        int[] y1,
                        int[] y2,
                        boolean[][] visited,
                        int yDelimiter)

isSafe_searchOnBottom

boolean isSafe_searchOnBottom(int[][] map,
                              int x,
                              int y,
                              int xDim,
                              int yDim,
                              boolean[][] visited,
                              int yDelimiter)

searchOnTop

int searchOnTop(int[][] map,
                int x,
                int y,
                int xDim,
                int yDim,
                int[] x1,
                int[] x2,
                int[] y1,
                int[] y2)

DFS_searchOnTop

void DFS_searchOnTop(int[][] map,
                     int x,
                     int y,
                     int xDim,
                     int yDim,
                     int[] x1,
                     int[] x2,
                     int[] y1,
                     int[] y2,
                     boolean[][] visited,
                     int yDelimiter)

isSafe_searchOnTop

boolean isSafe_searchOnTop(int[][] map,
                           int x,
                           int y,
                           int xDim,
                           int yDim,
                           boolean[][] visited,
                           int yDelimiter)

printMapOnTop

public void printMapOnTop(int[][] map,
                          int x,
                          int y,
                          int xDim,
                          int yDim)

printMapOnBottom

public void printMapOnBottom(int[][] map,
                             int x,
                             int y,
                             int xDim,
                             int yDim)

printVisitedMapOnTop

public void printVisitedMapOnTop(boolean[][] map,
                                 int x,
                                 int y,
                                 int xDim,
                                 int yDim)

printVisitedMapOnBottom

public void printVisitedMapOnBottom(boolean[][] map,
                                    int x,
                                    int y,
                                    int xDim,
                                    int yDim)

test

public int test()