Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 18 for Pathak (0.28 sec)

  1. graphs/breadth_first_search.py

    #!/usr/bin/python
    
    """ Author: OMKAR PATHAK """
    
    
    class Graph:
        def __init__(self):
            self.vertices = {}
    
        def printGraph(self):
            """prints adjacency list representation of graaph"""
            for i in self.vertices.keys():
                print(i, " : ", " -> ".join([str(j) for j in self.vertices[i]]))
    
        def addEdge(self, fromVertex, toVertex):
            """adding the edge between two vertices"""
    Python
    - Registered: 2020-07-02 19:18
    - Last Modified: 2020-04-19 13:56
    - 1.6K bytes
    - Viewed (0)
  2. data_structures/stacks/balanced_parentheses.py

    from .stack import Stack
    
    __author__ = "Omkar Pathak"
    
    
    def balanced_parentheses(parentheses):
        """ Use a stack to check if a string of parentheses is balanced."""
        stack = Stack(len(parentheses))
        for parenthesis in parentheses:
            if parenthesis == "(":
                stack.push(parenthesis)
            elif parenthesis == ")":
                if stack.is_empty():
                    return False
                stack.pop()
    Python
    - Registered: 2020-07-02 19:18
    - Last Modified: 2019-10-05 05:14
    - 673 bytes
    - Viewed (0)
  3. research/ptn/README.md

    Re-implemented by Xinchen Yan, Arkanath Pathak, Jasmine Hsu, Honglak Lee
    
    Reference: [Orginal implementation in Torch](https://github.com/xcyan/nips16_PTN)
    
    ## How to run this code
    
    Plain Text
    - Registered: 2020-06-19 13:06
    - Last Modified: 2020-04-24 18:20
    - 4.4K bytes
    - Viewed (0)
  4. data_structures/stacks/infix_to_postfix_conversion.py

    import string
    
    from .stack import Stack
    
    __author__ = "Omkar Pathak"
    
    
    def is_operand(char):
        return char in string.ascii_letters or char in string.digits
    
    
    def precedence(char):
        """ Return integer value representing an operator's precedence, or
        order of operation.
    
        https://en.wikipedia.org/wiki/Order_of_operations
        """
        dictionary = {"+": 1, "-": 1, "*": 2, "/": 2, "^": 3}
    Python
    - Registered: 2020-07-02 19:18
    - Last Modified: 2019-10-05 05:14
    - 1.8K bytes
    - Viewed (0)
  5. graphs/graph_list.py

    #!/usr/bin/python
    
    # Author: OMKAR PATHAK
    
    # We can use Python's dictionary for constructing the graph.
    
    
    class AdjacencyList:
        def __init__(self):
            self.List = {}
    
        def addEdge(self, fromVertex, toVertex):
            # check if vertex is already present
            if fromVertex in self.List.keys():
                self.List[fromVertex].append(toVertex)
            else:
                self.List[fromVertex] = [toVertex]
    
    Python
    - Registered: 2020-07-02 19:18
    - Last Modified: 2020-01-03 14:25
    - 957 bytes
    - Viewed (0)
  6. graphs/depth_first_search_2.py

    #!/usr/bin/python
    
    """ Author: OMKAR PATHAK """
    
    
    class Graph:
        def __init__(self):
            self.vertex = {}
    
        # for printing the Graph vertices
        def printGraph(self):
            print(self.vertex)
            for i in self.vertex.keys():
                print(i, " -> ", " -> ".join([str(j) for j in self.vertex[i]]))
    
        # for adding the edge between two vertices
        def addEdge(self, fromVertex, toVertex):
    Python
    - Registered: 2020-07-02 19:18
    - Last Modified: 2020-05-22 06:10
    - 1.6K bytes
    - Viewed (0)
  7. data_structures/stacks/stack.py

    __author__ = "Omkar Pathak"
    
    
    class Stack:
        """ A stack is an abstract data type that serves as a collection of
        elements with two principal operations: push() and pop(). push() adds an
        element to the top of the stack, and pop() removes an element from the top
        of a stack. The order in which elements come off of a stack are
        Last In, First Out (LIFO).
    
        https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
        """
    
    Python
    - Registered: 2020-07-02 19:18
    - Last Modified: 2020-05-03 21:58
    - 2.1K bytes
    - Viewed (0)
  8. sorts/bucket_sort.py

    #!/usr/bin/env python3
    """
    Illustrate how to implement bucket sort algorithm.
    
    Author: OMKAR PATHAK
    This program will illustrate how to implement bucket sort algorithm
    
    Wikipedia says: Bucket sort, or bin sort, is a sorting algorithm that works
    by distributing the elements of an array into a number of buckets.
    Each bucket is then sorted individually, either using a different sorting
    algorithm, or by recursively applying the bucket sorting algorithm. It is a
    Python
    - Registered: 2020-06-25 19:18
    - Last Modified: 2020-06-17 07:42
    - 2.3K bytes
    - Viewed (0)
  9. src/Faker/Provider/ne_NP/Person.php

            'Nakarmi', 'Napit', 'Nemkul', 'Nepal', 'Neupane', 'Niroula',
            'Ojha',
            'Pachhai', 'Pahari', 'Pandey', 'Pangeni', 'Panta', 'Parajuli', 'Pathak', 'Paudel', 'Pokhrel', 'Pradhan', 'Prajapati', 'Puri',
            'Rai', 'Raimajhi', 'Rana', 'Ranabhat', 'Rasali', 'Rauniyar', 'Rawat', 'Regmi', 'Rijal', 'Rimal', 'Rinpoche',
    PHP
    - Registered: 2020-06-23 13:09
    - Last Modified: 2019-07-06 03:56
    - 8.3K bytes
    - Viewed (0)
  10. README.md

    **Josh Gavant** <******@****.***>
    * [julianduque](https://github.com/julianduque) -
    **Julian Duque** <******@****.***> (he/him)
    * [kunalspathak](https://github.com/kunalspathak) -
    **Kunal Pathak** <kunal.pathak@microsoft.com>
    * [lucamaraschi](https://github.com/lucamaraschi) -
    **Luca Maraschi** <******@****.***> (he/him)
    * [lxe](https://github.com/lxe) -
    **Aleksey Smolenchuk** <******@****.***>
    Plain Text
    - Registered: 2020-06-30 21:40
    - Last Modified: 2020-06-04 12:14
    - 26.6K bytes
    - Viewed (0)
Back to top