NAME
WebService::UMLSKS::GetAllowablePaths - Get an allowable shortest path between the input terms.
SYNOPSIS
Basic Usage
use WebService::UMLSKS::GetAllowablePaths;DESCRIPTION
Get an allowable shortest path between the input terms.
SUBROUTINES
The subroutines are as follows:
new
This sub creates a new object of GetAllowablePaths
get_shortest_path_info
This sub returns the shortest path along with its cost
get_allpaths
This sub implements the BFS algorithm to find all possible paths between source and destination in the bidirected graph
get_allowable_paths
This sub filters set of allowable paths from all possible path.
get_shortest_path
This sub finds the shortest path between the two terms.
printHoH
This subroutines prints the current contents of hash of hash
printHash
This sub prints argument hash.
SEE ALSO
GetUserData.pm Query.pm ws-getShortestPath.pl GetParents.pm
AUTHORS
Mugdha Choudhari, University of Minnesota Duluth <chou0130 at d.umn.edu>
Ted Pedersen, University of Minnesota Duluth <tpederse at d.umn.edu>
COPYRIGHT
Copyright (C) 2010, Mugdha Choudhari, Ted Pedersen
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to The Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.