NAME

GetParents- Finds all possible paths between two concepts along with shortest of all the paths.

SYNOPSIS no warnings qw/redefine/; =head2 Basic Usage

    use WebService::UMLS::find_shortest_path;
    
        my $get_paths = new FindPaths;  
        my $parentInfo_ref = \%ParentInfo;
        # %ParentInfo is hash in which key is a concept and value is an array of it's parents' CUIs.
        # $source and $destination are the two input terms.
        $get_paths->find_paths($ParentInfo_ref,$source,$destination);  
   

DESCRIPTION

This module has package FindPaths which has subroutines 'new' and find_paths.

Methods

The subroutins are as follows:

new

This sub creates a new object of FindPaths

find_paths

find_paths: This sub uses a Graph module from CPAN and creates a graph using the concepts and their parent concepts. It finds shortest path between two input concepts and displays the path.

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.