cgfca

Class PathFinder

Object

cgfca.PathFinder

public class PathFinder
extends Object

The methods needed to support path finding in a repertory grid. The repertory grid is used for convenience since its structure is similar to a formal context.

Author:

Harry S. Delugach (delugach@uah.edu)

Field Summary

Fields

Modifier and Type	Field and Description
(package private) ArrayList<BinaryTuple>	binaries
(package private) String	cxtContent
(package private) String	filename
(package private) RepertoryGrid	grid
(package private) String	reportContent
(package private) boolean	reportOnlyInputOutputPaths
(package private) ArrayList<Concept>	targetConcepts

Constructor Summary

Constructors

Constructor and Description
PathFinder(RepertoryGrid grid, ArrayList<BinaryTuple> binaries, ArrayList<Concept> targetConcepts)

Method Summary

Modifier and Type	Method and Description
boolean	addToCurrentPaths(Path path, BinaryTuple bt, Concept con) Add the given path to the list of current paths, if it is not already there.
boolean	belongsInInputOutputReport(Path path) Whether a path belongs in an input-output report.
void	buildAllPaths() The main method of this class, which starts the process of building and storing paths.
void	buildPaths(BinaryTuple bt, Concept con) Build all possible paths from the binary tuple to the concept.
void	buildPaths(Path possiblePath, BinaryTuple startingTuple, Concept con) Find a path from the concept-relation binary to the given concept.
ArrayList<BinaryTuple>	findConceptInBinaries(Concept con) Get the list of all binaries with the concept in them.
ArrayList<Path>	getCurrentPaths(BinaryTuple bt, Concept con) Accesses the current paths (if any) between a binary tuple and the given concept.
String	getCxtContent()
String	getFilename() The filename of the graph being analyzed.
String	getReportContent()
static boolean	isInput(Concept c) Is the given concept an "input" concept as defined in the CGFCA world.
static boolean	isOutput(Concept c) Is the given concept an "output" concept as defined in the CGFCA world.
boolean	isPathAlreadyInList(Path path, ArrayList<Path> paths) Test whether a path list already contains the given path.
boolean	isReportOnlyInputOutputPaths() Should reporting of paths only include ones with "input" and "output" concepts as terminals (also cycles).
void	pruneCycles() Look for cycles in every cell, and if one is found, remove its equivalent cycle in any other cell in which it appears.
void	setFilename(String filename)
void	setReportOnlyInputOutputPaths(boolean reportOnlyInputOutputPaths)

Methods inherited from class Object

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

Field Detail

grid

RepertoryGrid grid

binaries

ArrayList<BinaryTuple> binaries

targetConcepts

ArrayList<Concept> targetConcepts

cxtContent

String cxtContent

reportContent

String reportContent

filename

String filename

reportOnlyInputOutputPaths

boolean reportOnlyInputOutputPaths

Constructor Detail

PathFinder

public PathFinder(RepertoryGrid grid,
                  ArrayList<BinaryTuple> binaries,
                  ArrayList<Concept> targetConcepts)

Method Detail

isReportOnlyInputOutputPaths

public boolean isReportOnlyInputOutputPaths()

Should reporting of paths only include ones with "input" and "output" concepts as terminals (also cycles).

Returns:

setReportOnlyInputOutputPaths

public void setReportOnlyInputOutputPaths(boolean reportOnlyInputOutputPaths)

getFilename

public String getFilename()

The filename of the graph being analyzed. Includes the ".cgx" extension.

Returns:

setFilename

public void setFilename(String filename)

getCurrentPaths

public ArrayList<Path> getCurrentPaths(BinaryTuple bt,
                                       Concept con)

Accesses the current paths (if any) between a binary tuple and the given concept.

Parameters:

bt -

con -

Returns:

empty list if there are no current paths; otherwise, the list of current paths.

addToCurrentPaths

public boolean addToCurrentPaths(Path path,
                                 BinaryTuple bt,
                                 Concept con)

Add the given path to the list of current paths, if it is not already there.

Parameters:

path - the path to add

bt -

con -

Returns:

true if the path was added; false if it was already there.

See Also:

Path.equals(cgfca.Path)

belongsInInputOutputReport

public boolean belongsInInputOutputReport(Path path)

Whether a path belongs in an input-output report.

Parameters:

path -

Returns:

true if the path is a cycle or if the path ends are input and output concepts.

getReportContent

public String getReportContent()

getCxtContent

public String getCxtContent()

buildAllPaths

public void buildAllPaths()

The main method of this class, which starts the process of building and storing paths. Modifies the grid such that each cell's values contain the set of paths from binaries to concepts.

Parameters:

grid -

binaries -

targetConcepts -

buildPaths

public void buildPaths(BinaryTuple bt,
                       Concept con)

Build all possible paths from the binary tuple to the concept. Store the paths as RGPathValue objects in this object's repertory grid.

Parameters:

bt -

con -

buildPaths

public void buildPaths(Path possiblePath,
                       BinaryTuple startingTuple,
                       Concept con)

Find a path from the concept-relation binary to the given concept. Along the way, save any paths that are new in the intermediate cells of the grid.

Parameters:

possiblePath - contains a path ending in the binary tuple that's the argument

startingTuple - The original tuple that started this path. It is used for determining which column the path belongs in.

c2 -

isOutput

public static boolean isOutput(Concept c)

Is the given concept an "output" concept as defined in the CGFCA world.

Parameters:

c -

Returns:

true if it has no outgoing edges, false otherwise.

isInput

public static boolean isInput(Concept c)

Is the given concept an "input" concept as defined in the CGFCA world.

Parameters:

c -

Returns:

true if it has no incoming edges, false otherwise.

findConceptInBinaries

public ArrayList<BinaryTuple> findConceptInBinaries(Concept con)

Get the list of all binaries with the concept in them. Note that it must be the first concept, because that's all a binary cares about.

Parameters:

con -

Returns:

a possibly zero-length list.

isPathAlreadyInList

public boolean isPathAlreadyInList(Path path,
                                   ArrayList<Path> paths)

Test whether a path list already contains the given path.

Parameters:

path - The path to test

paths - A list of paths

Returns:

true if either the path itself or the path reversed are in the list.

See Also:

Object.equals(java.lang.Object)

pruneCycles

public void pruneCycles()

Look for cycles in every cell, and if one is found, remove its equivalent cycle in any other cell in which it appears. For example, if a cycle A-B-C-D-A exists, then the cycle B-C-D-A-B also exists. Arbitrarily keep the first one found and remove the others.