Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Programming Assignment 7 Looking For Cycles in A Graph Submission Deadline: 11:55PM, Sunday Nov. 16, 2014 Submissions Only Via Moodle

    Uploaded by

    Sanjana Arora
    This document provides instructions for Programming Assignment 7 which involves looking for cycles in a graph represented as an adjacency list. Students are asked to write a function that takes an adjacency list as input and returns all the cycles present in the graph as well as the longest cycle. The input graph will be provided as an (int * int list) list and students must also write a function to validate that the input represents a valid graph. They are advised to use a stack data structure and must thoroughly test and document their programs along with analyzing the time and space complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Programming Assignment 7 Looking For Cycles in A Graph Submission Deadline: 11:55PM, Sunday Nov. 16, 2014 Submissions Only Via Moodle

    Uploaded by

    Sanjana Arora
    17 views1 page
    This document provides instructions for Programming Assignment 7 which involves looking for cycles in a graph represented as an adjacency list. Students are asked to write a function that takes an adjacency list as input and returns all the cycles present in the graph as well as the longest cycle. The input graph will be provided as an (int * int list) list and students must also write a function to validate that the input represents a valid graph. They are advised to use a stack data structure and must thoroughly test and document their programs along with analyzing the time and space complexity.

    Original Description:

    Assignment 7 CS

    Original Title

    Assign 7

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides instructions for Programming Assignment 7 which involves looking for cycles in a graph represented as an adjacency list. Students are asked to write a function that takes an adjacency list as input and returns all the cycles present in the graph as well as the longest cycle. The input graph will be provided as an (int * int list) list and students must also write a function to validate that the input represents a valid graph. They are advised to use a stack data structure and must thoroughly test and document their programs along with analyzing the time and space complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    17 views1 page

    Programming Assignment 7 Looking For Cycles in A Graph Submission Deadline: 11:55PM, Sunday Nov. 16, 2014 Submissions Only Via Moodle

    Uploaded by

    Sanjana Arora
    This document provides instructions for Programming Assignment 7 which involves looking for cycles in a graph represented as an adjacency list. Students are asked to write a function that takes an adjacency list as input and returns all the cycles present in the graph as well as the longest cycle. The input graph will be provided as an (int * int list) list and students must also write a function to validate that the input represents a valid graph. They are advised to use a stack data structure and must thoroughly test and document their programs along with analyzing the time and space complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Programming Assignment 7

    Looking for Cycles in a Graph


    Submission Deadline: 11:55PM, Sunday Nov. 16, 2014
    Submissions only via Moodle
    An alternative way to represent a graph is as an adjacency list. Assume the
    nodes of the graph are numbered from 1 to N . An adjacency list representation
    of a graph lists for each node i, the set of immediate neighbouring nodes of node
    i, i.e., all those nodes j such that there is an edge between (i, j) in the graph.
    A possible way of representing an adjacency list is
    type adj_list = (int * (int list)) list;;
    This is a list of elements, each of the form (i, [j1 ; . . . ; jk ]) which means that there
    are edges from i to each of j1 ... jk .
    Depending on the operations, if one wishes to search for a nodes adjacency
    list quickly, one may use a structure such as a binary search tree, where finding
    a nodes information is quicker.
    In this assignment, you will be given as input a directed graph in adjacency
    list form, with nodes labeled from 1 to N for some N . The problem is to list
    all possible cycles that appear in the graph. In addition, you should find the
    longest cycle. Recall that a cycle is a sequence of nodes u0 , u1 , . . . uk such that
    all the edges (ui , ui+1 ) exist for 0 i < k and also the edge (uk , u0 ) exists.
    The input will be provided as an (int * int list) list. You will need to
    write a function validGraph : (int * int list) list -> bool that verifies that the given input is a graph. Note that the node ids in the list l could
    be any integers and need not be in the range 1 . . .Length l.
    You should use your Stack package (possibly modified). You must document
    your programs adequately, and test your program. You should also analyse the
    time and space required.

    You might also like