SYMBOL INDEX (429 symbols across 68 files)

FILE: codes/python/01_array/array_maxheap.py
  class MaxHeap (line 1) | class MaxHeap:
    method __init__ (line 2) | def __init__(self):
    method peek (line 5) | def peek(self) -> int:
    method push (line 12) | def push(self, val: int):
    method __shift_up (line 20) | def __shift_up(self, i: int):
    method pop (line 25) | def pop(self) -> int:
    method __shift_down (line 43) | def __shift_down(self, i: int, n: int):
  class Solution (line 69) | class Solution:
    method maxHeapOperations (line 70) | def maxHeapOperations(self):

FILE: codes/python/01_array/array_sort_bubble_sort.py
  class Solution (line 1) | class Solution:
    method bubbleSort (line 2) | def bubbleSort(self, nums: [int]) -> [int]:
    method sortArray (line 17) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_bucket_sort.py
  class Solution (line 1) | class Solution:
    method insertionSort (line 2) | def insertionSort(self, nums: [int]) -> [int]:
    method bucketSort (line 17) | def bucketSort(self,  nums: [int], bucket_size=5) -> [int]:
    method sortArray (line 38) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_counting_sort.py
  class Solution (line 1) | class Solution:
    method countingSort (line 2) | def countingSort(self, nums: [int]) -> [int]:
    method sortArray (line 28) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_insertion_sort.py
  class Solution (line 1) | class Solution:
    method insertionSort (line 2) | def insertionSort(self, nums: [int]) -> [int]:
    method sortArray (line 17) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_maxheap_sort.py
  class MaxHeap (line 1) | class MaxHeap:
    method __init__ (line 2) | def __init__(self):
    method peek (line 5) | def peek(self) -> int:
    method push (line 12) | def push(self, val: int):
    method __shift_up (line 20) | def __shift_up(self, i: int):
    method pop (line 25) | def pop(self) -> int:
    method __shift_down (line 43) | def __shift_down(self, i: int, n: int):
    method __buildMaxHeap (line 68) | def __buildMaxHeap(self, nums: [int]):
    method maxHeapSort (line 78) | def maxHeapSort(self, nums: [int]) -> [int]:
  class Solution (line 92) | class Solution:
    method maxHeapSort (line 93) | def maxHeapSort(self, nums: [int]) -> [int]:
    method sortArray (line 96) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_merge_sort.py
  class Solution (line 1) | class Solution:
    method merge (line 3) | def merge(self, left_nums: [int], right_nums: [int]):
    method mergeSort (line 29) | def mergeSort(self, nums: [int]) -> [int]:
    method sortArray (line 39) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_minheap_sort.py
  class MinHeap (line 1) | class MinHeap:
    method __init__ (line 2) | def __init__(self):
    method peek (line 5) | def peek(self) -> int:
    method push (line 12) | def push(self, val: int):
    method __shift_up (line 20) | def __shift_up(self, i: int):
    method pop (line 25) | def pop(self) -> int:
    method __shift_down (line 43) | def __shift_down(self, i: int, n: int):
    method __buildMinHeap (line 68) | def __buildMinHeap(self, nums: [int]):
    method minHeapSort (line 78) | def minHeapSort(self, nums: [int]) -> [int]:
  class Solution (line 92) | class Solution:
    method minHeapSort (line 93) | def minHeapSort(self, nums: [int]) -> [int]:
    method sortArray (line 96) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_quick_sort.py
  class Solution (line 3) | class Solution:
    method randomPartition (line 5) | def randomPartition(self, nums: [int], low: int, high: int) -> int:
    method partition (line 14) | def partition(self, nums: [int], low: int, high: int) -> int:
    method quickSort (line 33) | def quickSort(self, nums: [int], low: int, high: int) -> [int]:
    method sortArray (line 43) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_radix_sort.py
  class Solution (line 1) | class Solution:
    method radixSort (line 2) | def radixSort(self, nums: [int]) -> [int]:
    method sortArray (line 23) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_selection_sort.py
  class Solution (line 1) | class Solution:
    method selectionSort (line 2) | def selectionSort(self, nums: [int]) -> [int]:
    method sortArray (line 14) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/01_array/array_sort_shell_sort.py
  class Solution (line 1) | class Solution:
    method shellSort (line 2) | def shellSort(self, nums: [int]) -> [int]:
    method sortArray (line 23) | def sortArray(self, nums: [int]) -> [int]:

FILE: codes/python/02_linked_list/linked_list.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class LinkedList (line 6) | class LinkedList:
    method __init__ (line 7) | def __init__(self):
    method create (line 11) | def create(self, data):
    method length (line 22) | def length(self):
    method find (line 31) | def find(self, val):
    method insertFront (line 41) | def insertFront(self, val):
    method insertRear (line 47) | def insertRear(self, val):
    method insertInside (line 56) | def insertInside(self, index, val):
    method change (line 71) | def change(self, index, val):
    method removeFront (line 84) | def removeFront(self):
    method removeRear (line 89) | def removeRear(self):
    method removeInside (line 99) | def removeInside(self, index):

FILE: codes/python/02_linked_list/linked_list_bubble_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method bubbleSort (line 7) | def bubbleSort(self, head: ListNode):
    method sortLinkedList (line 24) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/02_linked_list/linked_list_bucket_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method insertion (line 8) | def insertion(self, buckets, index, val):
    method merge (line 18) | def merge(self, left, right):
    method mergeSort (line 39) | def mergeSort(self, head: ListNode):
    method bucketSort (line 57) | def bucketSort(self, head: ListNode, bucket_size=5):
    method sortList (line 94) | def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]:

FILE: codes/python/02_linked_list/linked_list_counting_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method countingSort (line 7) | def countingSort(self, head: ListNode):
    method sortLinkedList (line 37) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/02_linked_list/linked_list_insertion_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method insertionSort (line 7) | def insertionSort(self, head: ListNode):
    method sortLinkedList (line 32) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/02_linked_list/linked_list_merge_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method merge (line 7) | def merge(self, left, right):
    method mergeSort (line 27) | def mergeSort(self, head: ListNode):
    method sortLinkedList (line 46) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/02_linked_list/linked_list_quick_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method partition (line 7) | def partition(self, left: ListNode, right: ListNode):
    method quickSort (line 29) | def quickSort(self, left: ListNode, right: ListNode):
    method sortLinkedList (line 37) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/02_linked_list/linked_list_radix_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method radixSort (line 7) | def radixSort(self, head: ListNode):
    method sortLinkedList (line 37) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/02_linked_list/linked_list_section_sort.py
  class ListNode (line 1) | class ListNode:
    method __init__ (line 2) | def __init__(self, val=0, next=None):
  class Solution (line 6) | class Solution:
    method sectionSort (line 7) | def sectionSort(self, head: ListNode):
    method sortLinkedList (line 25) | def sortLinkedList(self, head: ListNode):

FILE: codes/python/03_stack_queue_hash_table/queue_circularSequential_queue.py
  class Queue (line 1) | class Queue:
    method __init__ (line 3) | def __init__(self, size=100):
    method is_empty (line 10) | def is_empty(self):
    method is_full (line 14) | def is_full(self):
    method enqueue (line 18) | def enqueue(self, value):
    method dequeue (line 26) | def dequeue(self):
    method front_value (line 35) | def front_value(self):
    method rear_value (line 43) | def rear_value(self):

FILE: codes/python/03_stack_queue_hash_table/queue_deque.py
  class Node (line 1) | class Node:
    method __init__ (line 3) | def __init__(self, value):
  class Deque (line 8) | class Deque:
    method __init__ (line 10) | def __init__(self):
    method is_empty (line 19) | def is_empty(self):
    method get_size (line 23) | def get_size(self):
    method push_front (line 27) | def push_front(self, value):
    method push_back (line 37) | def push_back(self, value):
    method pop_front (line 47) | def pop_front(self):
    method pop_back (line 59) | def pop_back(self):
    method peek_front (line 71) | def peek_front(self):
    method peek_back (line 77) | def peek_back(self):
  class ArrayDeque (line 83) | class ArrayDeque:
    method __init__ (line 85) | def __init__(self, capacity=100):
    method is_empty (line 93) | def is_empty(self):
    method is_full (line 97) | def is_full(self):
    method get_size (line 101) | def get_size(self):
    method push_front (line 105) | def push_front(self, value):
    method push_back (line 115) | def push_back(self, value):
    method pop_front (line 125) | def pop_front(self):
    method pop_back (line 136) | def pop_back(self):
    method peek_front (line 147) | def peek_front(self):
    method peek_back (line 153) | def peek_back(self):

FILE: codes/python/03_stack_queue_hash_table/queue_link_queue.py
  class Node (line 1) | class Node:
    method __init__ (line 2) | def __init__(self, value):
  class Queue (line 6) | class Queue:
    method __init__ (line 8) | def __init__(self):
    method is_empty (line 14) | def is_empty(self):
    method enqueue (line 18) | def enqueue(self, value):
    method dequeue (line 24) | def dequeue(self):
    method front_value (line 37) | def front_value(self):
    method rear_value (line 44) | def rear_value(self):

FILE: codes/python/03_stack_queue_hash_table/queue_priority_queue.py
  class Heapq (line 1) | class Heapq:
    method heapAdjust (line 3) | def heapAdjust(self, nums: [int], index: int, end: int):
    method heapify (line 23) | def heapify(self, nums: [int]):
    method heappush (line 31) | def heappush(self, nums: list, value):
    method heappop (line 48) | def heappop(self, nums: list) -> int:
    method heapSort (line 59) | def heapSort(self, nums: [int]):

FILE: codes/python/03_stack_queue_hash_table/queue_sequential_queue.py
  class Queue (line 1) | class Queue:
    method __init__ (line 3) | def __init__(self, size=100):
    method is_empty (line 10) | def is_empty(self):
    method is_full (line 14) | def is_full(self):
    method enqueue (line 18) | def enqueue(self, value):
    method dequeue (line 26) | def dequeue(self):
    method front_value (line 35) | def front_value(self):
    method rear_value (line 42) | def rear_value(self):

FILE: codes/python/03_stack_queue_hash_table/stack_link_stack.py
  class Node (line 1) | class Node:
    method __init__ (line 2) | def __init__(self, value):
  class Stack (line 6) | class Stack:
    method __init__ (line 8) | def __init__(self):
    method is_empty (line 12) | def is_empty(self):
    method push (line 16) | def push(self, value):
    method pop (line 22) | def pop(self):
    method peek (line 31) | def peek(self):

FILE: codes/python/03_stack_queue_hash_table/stack_monotone_stack.py
  function monotoneStack (line 3) | def monotoneStack(nums):
  function monotoneIncreasingStack (line 14) | def monotoneIncreasingStack(nums):
  function monotoneDecreasingStack (line 24) | def monotoneDecreasingStack(nums):

FILE: codes/python/03_stack_queue_hash_table/stack_sequential_stack.py
  class Stack (line 3) | class Stack:
    method __init__ (line 5) | def __init__(self, size=100):
    method is_empty (line 11) | def is_empty(self):
    method is_full (line 15) | def is_full(self):
    method push (line 19) | def push(self, value):
    method pop (line 27) | def pop(self):
    method peek (line 35) | def peek(self):

FILE: codes/python/04_string/string_Strcmp.py
  function strcmp (line 1) | def strcmp(str1, str2):

FILE: codes/python/04_string/string_boyer_moore.py
  function boyerMoore (line 2) | def boyerMoore(T: str, p: str) -> int:
  function generateBadCharTable (line 23) | def generateBadCharTable(p: str):
  function generageGoodSuffixList (line 32) | def generageGoodSuffixList(p: str):
  function generageSuffixArray (line 56) | def generageSuffixArray(p: str):

FILE: codes/python/04_string/string_brute_force.py
  function bruteForce (line 1) | def bruteForce(T: str, p: str) -> int:

FILE: codes/python/04_string/string_horspool.py
  function horspool (line 2) | def horspool(T: str, p: str) -> int:
  function generateBadCharTable (line 19) | def generateBadCharTable(p: str):

FILE: codes/python/04_string/string_kmp.py
  function kmp (line 2) | def kmp(T: str, p: str) -> int:
  function generateNext (line 20) | def generateNext(p: str):

FILE: codes/python/04_string/string_rabin_karp.py
  function rabinKarp (line 2) | def rabinKarp(T: str, p: str, d, q) -> int:

FILE: codes/python/04_string/string_sunday.py
  function sunday (line 2) | def sunday(T: str, p: str) -> int:
  function generateBadCharTable (line 19) | def generateBadCharTable(p: str):

FILE: codes/python/04_string/string_trie.py
  class Node (line 1) | class Node:                                     # 字符节点
    method __init__ (line 2) | def __init__(self):                         # 初始化字符节点
  class Trie (line 7) | class Trie:                                     # 字典树
    method __init__ (line 10) | def __init__(self):                         # 初始化字典树
    method insert (line 14) | def insert(self, word: str) -> None:
    method search (line 23) | def search(self, word: str) -> bool:
    method startsWith (line 33) | def startsWith(self, prefix: str) -> bool:

FILE: codes/python/05_tree/tree_binaryindexed_tree.py
  class BinaryIndexTree (line 1) | class BinaryIndexTree:
    method __init__ (line 3) | def __init__(self, n):
    method lowbit (line 7) | def lowbit(self, index):
    method update (line 10) | def update(self, index, delta):
    method query (line 15) | def query(self, index):

FILE: codes/python/05_tree/tree_dynamicSegmentTree_update_interval_1.py
  class SegTreeNode (line 2) | class SegTreeNode:
    method __init__ (line 3) | def __init__(self, left=-1, right=-1, val=False, lazy_tag=None, leftNo...
  class SegmentTree (line 14) | class SegmentTree:
    method __init__ (line 16) | def __init__(self, function):
    method update_point (line 21) | def update_point(self, i, val):
    method update_interval (line 25) | def update_interval(self, q_left, q_right, val):
    method query_interval (line 29) | def query_interval(self, q_left, q_right):
    method get_nums (line 33) | def get_nums(self, length):
    method __update_point (line 43) | def __update_point(self, i, val, node):
    method __update_interval (line 55) | def __update_interval(self, q_left, q_right, val, node):
    method __query_interval (line 74) | def __query_interval(self, q_left, q_right, node):
    method __pushup (line 91) | def __pushup(self, node):
    method __pushdown (line 96) | def __pushdown(self, node):
  class Solution (line 117) | class Solution:
    method __init__ (line 119) | def __init__(self):
    method update (line 123) | def update(self, left: int, right: int, val) -> None:
    method sumRange (line 127) | def sumRange(self, left: int, right: int) -> int:

FILE: codes/python/05_tree/tree_dynamicSegmentTree_update_interval_2.py
  class SegTreeNode (line 2) | class SegTreeNode:
    method __init__ (line 3) | def __init__(self, left=-1, right=-1, val=0, lazy_tag=None, leftNode=N...
  class SegmentTree (line 14) | class SegmentTree:
    method __init__ (line 16) | def __init__(self, function):
    method update_point (line 21) | def update_point(self, i, val):
    method update_interval (line 25) | def update_interval(self, q_left, q_right, val):
    method query_interval (line 29) | def query_interval(self, q_left, q_right):
    method get_nums (line 33) | def get_nums(self, length):
    method __update_point (line 43) | def __update_point(self, i, val, node):
    method __update_interval (line 55) | def __update_interval(self, q_left, q_right, val, node):
    method __query_interval (line 77) | def __query_interval(self, q_left, q_right, node):
    method __pushup (line 94) | def __pushup(self, node):
    method __pushdown (line 99) | def __pushdown(self, node):
  class Solution (line 126) | class Solution:
    method __init__ (line 128) | def __init__(self):
    method update (line 132) | def update(self, left: int, right: int, val) -> None:
    method sumRange (line 136) | def sumRange(self, left: int, right: int) -> int:

FILE: codes/python/05_tree/tree_segmentTree_update_interval_1.py
  class SegTreeNode (line 2) | class SegTreeNode:
    method __init__ (line 3) | def __init__(self, val=0):
  class SegmentTree (line 11) | class SegmentTree:
    method __init__ (line 13) | def __init__(self, nums, function):
    method update_point (line 22) | def update_point(self, i, val):
    method update_interval (line 27) | def update_interval(self, q_left, q_right, val):
    method query_interval (line 31) | def query_interval(self, q_left, q_right):
    method get_nums (line 35) | def get_nums(self):
    method __build (line 44) | def __build(self, index, left, right):
    method __update_point (line 59) | def __update_point(self, i, val, index):
    method __update_interval (line 78) | def __update_interval(self, q_left, q_right, val, index):
    method __query_interval (line 108) | def __query_interval(self, q_left, q_right, index):
    method __pushup (line 132) | def __pushup(self, index):
    method __pushdown (line 138) | def __pushdown(self, index):
  class Solution (line 157) | class Solution:
    method __init__ (line 159) | def __init__(self, nums: List[int]):
    method update (line 163) | def update(self, left: int, right: int, val) -> None:
    method sumRange (line 167) | def sumRange(self, left: int, right: int) -> int:

FILE: codes/python/05_tree/tree_segmentTree_update_interval_2.py
  class SegTreeNode (line 2) | class SegTreeNode:
    method __init__ (line 3) | def __init__(self, val=0):
  class SegmentTree (line 11) | class SegmentTree:
    method __init__ (line 13) | def __init__(self, nums, function):
    method update_point (line 22) | def update_point(self, i, val):
    method update_interval (line 27) | def update_interval(self, q_left, q_right, val):
    method query_interval (line 31) | def query_interval(self, q_left, q_right):
    method get_nums (line 35) | def get_nums(self):
    method __build (line 44) | def __build(self, index, left, right):
    method __update_point (line 59) | def __update_point(self, i, val, index):
    method __update_interval (line 78) | def __update_interval(self, q_left, q_right, val, index):
    method __query_interval (line 107) | def __query_interval(self, q_left, q_right, index):
    method __pushup (line 131) | def __pushup(self, index):
    method __pushdown (line 137) | def __pushdown(self, index):
  class Solution (line 162) | class Solution:
    method __init__ (line 164) | def __init__(self, nums: List[int]):
    method addVal (line 168) | def addVal(self, left: int, right: int, val) -> None:
    method sumRange (line 172) | def sumRange(self, left: int, right: int) -> int:

FILE: codes/python/05_tree/tree_segmentTree_update_point.py
  class SegTreeNode (line 2) | class SegTreeNode:
    method __init__ (line 3) | def __init__(self, val=0):
  class SegmentTree (line 10) | class SegmentTree:
    method __init__ (line 12) | def __init__(self, nums, function):
    method update_point (line 21) | def update_point(self, i, val):
    method query_interval (line 26) | def query_interval(self, q_left, q_right):
    method get_nums (line 30) | def get_nums(self):
    method __build (line 39) | def __build(self, index, left, right):
    method __update_point (line 55) | def __update_point(self, i, val, index):
    method __query_interval (line 75) | def __query_interval(self, q_left, q_right, index):
    method __pushup (line 97) | def __pushup(self, index):
  class Solution (line 104) | class Solution:
    method __init__ (line 106) | def __init__(self, nums: List[int]):
    method update (line 110) | def update(self, index: int, val: int) -> None:
    method sumRange (line 114) | def sumRange(self, left: int, right: int) -> int:

FILE: codes/python/05_tree/tree_unionFind.py
  class UnionFind (line 1) | class UnionFind:
    method __init__ (line 2) | def __init__(self, n):                          # 初始化
    method find (line 5) | def find(self, x):                              # 查找元素根节点的集合编号内部实现方法
    method union (line 11) | def union(self, x, y):                          # 合并操作：令其中一个集合的树根节点指向另...
    method is_connected (line 19) | def is_connected(self, x, y):                   # 查询操作：判断 x 和 y 是否同属于一个集合

FILE: codes/python/05_tree/tree_unionFind_QuickFind.py
  class UnionFind (line 1) | class UnionFind:
    method __init__ (line 2) | def __init__(self, n):                          # 初始化：将每个元素的集合编号初始化为数组...
    method find (line 5) | def find(self, x):                              # 查找元素所属集合编号内部实现方法
    method union (line 8) | def union(self, x, y):                          # 合并操作：将集合 x 和集合 y 合并成...
    method is_connected (line 20) | def is_connected(self, x, y):                   # 查询操作：判断 x 和 y 是否同属于一个集合

FILE: codes/python/05_tree/tree_unionFind_QuickUnion.py
  class UnionFind (line 1) | class UnionFind:
    method __init__ (line 2) | def __init__(self, n):                          # 初始化：将每个元素的集合编号初始化为数组...
    method find (line 5) | def find(self, x):                              # 查找元素根节点的集合编号内部实现方法
    method union (line 10) | def union(self, x, y):                          # 合并操作：令其中一个集合的树根节点指向另...
    method is_connected (line 18) | def is_connected(self, x, y):                   # 查询操作：判断 x 和 y 是否同属于一个集合

FILE: codes/python/05_tree/tree_unionFind_UnoinByRank.py
  class UnionFind (line 1) | class UnionFind:
    method __init__ (line 2) | def __init__(self, n):                          # 初始化
    method find (line 6) | def find(self, x):                              # 查找元素根节点的集合编号内部实现方法
    method union (line 12) | def union(self, x, y):                          # 合并操作：令其中一个集合的树根节点指向另...
    method is_connected (line 27) | def is_connected(self, x, y):                   # 查询操作：判断 x 和 y 是否同属于一个集合

FILE: codes/python/05_tree/tree_unionFind_UnoinBySize.py
  class UnionFind (line 1) | class UnionFind:
    method __init__ (line 2) | def __init__(self, n):                          # 初始化
    method find (line 6) | def find(self, x):                              # 查找元素根节点的集合编号内部实现方法
    method union (line 12) | def union(self, x, y):                          # 合并操作：令其中一个集合的树根节点指向另...
    method is_connected (line 30) | def is_connected(self, x, y):                   # 查询操作：判断 x 和 y 是否同属于一个集合

FILE: codes/python/06_graph/Graph-Adjacency-List.py
  class EdgeNode (line 1) | class EdgeNode:                                 # 边信息类
    method __init__ (line 2) | def __init__(self, vj, val):
  class VertexNode (line 7) | class VertexNode:                               # 顶点信息类
    method __init__ (line 8) | def __init__(self, vi):
  class Graph (line 12) | class Graph:
    method __init__ (line 13) | def __init__(self, ver_count):
    method __valid (line 21) | def __valid(self, v):
    method creatGraph (line 25) | def creatGraph(self, edges=[]):
    method add_edge (line 30) | def add_edge(self, vi, vj, val):
    method get_edge (line 40) | def get_edge(self, vi, vj):
    method printGraph (line 53) | def printGraph(self):

FILE: codes/python/06_graph/Graph-Adjacency-Matrix.py
  class Graph (line 1) | class Graph:                                    # 基本图类，采用邻接矩阵表示
    method __init__ (line 3) | def __init__(self, ver_count):
    method __valid (line 8) | def __valid(self, v):
    method creatGraph (line 12) | def creatGraph(self, edges=[]):
    method add_edge (line 17) | def add_edge(self, vi, vj, val):
    method get_edge (line 24) | def get_edge(self, vi, vj):
    method printGraph (line 31) | def printGraph(self):

FILE: codes/python/06_graph/Graph-BFS.py
  class Solution (line 3) | class Solution:
    method bfs (line 4) | def bfs(self, graph, u):

FILE: codes/python/06_graph/Graph-Bellman-Ford.py
  class Solution (line 1) | class Solution:
    method bellmanFord (line 2) | def bellmanFord(self, graph, source):

FILE: codes/python/06_graph/Graph-DFS.py
  class Solution (line 1) | class Solution:
    method dfs_recursive (line 2) | def dfs_recursive(self, graph, u, visited):
    method dfs_stack (line 11) | def dfs_stack(self, graph, u):

FILE: codes/python/06_graph/Graph-Edgeset-Array.py
  class EdgeNode (line 1) | class EdgeNode:                                 # 边信息类
    method __init__ (line 2) | def __init__(self, vi, vj, val):
  class Graph (line 7) | class Graph:                                    # 基本图类，采用边集数组表示
    method __init__ (line 8) | def __init__(self):
    method creatGraph (line 12) | def creatGraph(self, edges=[]):
    method add_edge (line 17) | def add_edge(self, vi, vj, val):
    method get_edge (line 22) | def get_edge(self, vi, vj):
    method printGraph (line 30) | def printGraph(self):

FILE: codes/python/06_graph/Graph-Hash-Table.py
  class VertexNode (line 1) | class VertexNode:                               # 顶点信息类
    method __init__ (line 2) | def __init__(self, vi):
  class Graph (line 6) | class Graph:
    method __init__ (line 7) | def __init__(self):
    method creatGraph (line 11) | def creatGraph(self, edges=[]):
    method add_vertex (line 16) | def add_vertex(self, vi):
    method add_edge (line 21) | def add_edge(self, vi, vj, val):
    method get_edge (line 30) | def get_edge(self, vi, vj):
    method printGraph (line 36) | def printGraph(self):

FILE: codes/python/06_graph/Graph-Kruskal.py
  class UnionFind (line 1) | class UnionFind:
    method __init__ (line 3) | def __init__(self, n):
    method find (line 7) | def find(self, x):
    method union (line 13) | def union(self, x, y):
    method is_connected (line 22) | def is_connected(self, x, y):
  class Solution (line 26) | class Solution:
    method Kruskal (line 27) | def Kruskal(self, edges, size):
    method minCostConnectPoints (line 43) | def minCostConnectPoints(self, points: List[List[int]]) -> int:

FILE: codes/python/06_graph/Graph-Linked-Forward-Star.py
  class EdgeNode (line 1) | class EdgeNode:                                 # 边信息类
    method __init__ (line 2) | def __init__(self, vj, val):
  class Graph (line 7) | class Graph:
    method __init__ (line 8) | def __init__(self, ver_count, edge_count):
    method __valid (line 15) | def __valid(self, v):
    method creatGraph (line 19) | def creatGraph(self, edges=[]):
    method add_edge (line 25) | def add_edge(self, index, vi, vj, val):
    method get_edge (line 35) | def get_edge(self, vi, vj):
    method printGraph (line 47) | def printGraph(self):

FILE: codes/python/06_graph/Graph-Prim.py
  class Solution (line 1) | class Solution:
    method Prim (line 3) | def Prim(self, graph, start):

FILE: codes/python/06_graph/Graph-Topological-Sorting-DFS.py
  class Solution (line 3) | class Solution:
    method topologicalSortingDFS (line 5) | def topologicalSortingDFS(self, graph: dict):
    method findOrder (line 36) | def findOrder(self, n: int, edges):

FILE: codes/python/06_graph/Graph-Topological-Sorting-Kahn.py
  class Solution (line 3) | class Solution:
    method topologicalSortingKahn (line 5) | def topologicalSortingKahn(self, graph: dict):
    method findOrder (line 28) | def findOrder(self, n: int, edges):

FILE: codes/python/08_dynamic_programming/Digit-DP.py
  class Solution (line 1) | class Solution:
    method digitDP (line 2) | def digitDP(self, n: int) -> int:

FILE: codes/python/08_dynamic_programming/Pack-2DCostPack.py
  class Solution (line 1) | class Solution:
    method twoDCostPackMethod1 (line 3) | def twoDCostPackMethod1(self, weight: [int], volume: [int], value: [in...
    method twoDCostPackMethod2 (line 24) | def twoDCostPackMethod2(self, weight: [int], volume: [int], value: [in...

FILE: codes/python/08_dynamic_programming/Pack-CompletePack.py
  class Solution (line 1) | class Solution:
    method completePackMethod1 (line 3) | def completePackMethod1(self, weight: [int], value: [int], W: int):
    method completePackMethod2 (line 19) | def completePackMethod2(self, weight: [int], value: [int], W: int):
    method completePackMethod3 (line 38) | def completePackMethod3(self, weight: [int], value: [int], W: int):

FILE: codes/python/08_dynamic_programming/Pack-GroupPack.py
  class Solution (line 1) | class Solution:
    method groupPackMethod1 (line 3) | def groupPackMethod1(self, group_count: [int], weight: [[int]], value:...
    method groupPackMethod2 (line 21) | def groupPackMethod2(self, group_count: [int], weight: [[int]], value:...

FILE: codes/python/08_dynamic_programming/Pack-MixedPack.py
  class Solution (line 1) | class Solution:
    method mixedPackMethod1 (line 2) | def mixedPackMethod1(self, weight: [int], value: [int], count: [int], ...

FILE: codes/python/08_dynamic_programming/Pack-MultiplePack.py
  class Solution (line 1) | class Solution:
    method multiplePackMethod1 (line 3) | def multiplePackMethod1(self, weight: [int], value: [int], count: [int...
    method multiplePackMethod2 (line 19) | def multiplePackMethod2(self, weight: [int], value: [int], count: [int...
    method multiplePackMethod3 (line 35) | def multiplePackMethod3(self, weight: [int], value: [int], count: [int...

FILE: codes/python/08_dynamic_programming/Pack-ProblemVariants.py
  class Solution (line 1) | class Solution:
    method zeroOnePackJustFillUp (line 5) | def zeroOnePackJustFillUp(self, weight: [int], value: [int], W: int):
    method completePackJustFillUp (line 22) | def completePackJustFillUp(self, weight: [int], value: [int], W: int):
    method zeroOnePackNumbers (line 42) | def zeroOnePackNumbers(self, weight: [int], value: [int], W: int):
    method completePackNumbers (line 57) | def completePackNumbers(self, weight: [int], value: [int], W: int):
    method zeroOnePackMaxProfitNumbers1 (line 75) | def zeroOnePackMaxProfitNumbers1(self, weight: [int], value: [int], W:...
    method zeroOnePackMaxProfitNumbers2 (line 109) | def zeroOnePackMaxProfitNumbers2(self, weight: [int], value: [int], W:...
    method completePackMaxProfitNumbers1 (line 131) | def completePackMaxProfitNumbers1(self, weight: [int], value: [int], W...
    method completePackMaxProfitNumbers2 (line 165) | def completePackMaxProfitNumbers2(self, weight: [int], value: [int], W...
    method zeroOnePackPrintPath (line 190) | def zeroOnePackPrintPath(self, weight: [int], value: [int], W: int):
    method zeroOnePackPrintPathMinOrder (line 232) | def zeroOnePackPrintPathMinOrder(self, weight: [int], value: [int], W:...

FILE: codes/python/08_dynamic_programming/Pack-ZeroOnePack.py
  class Solution (line 1) | class Solution:
    method zeroOnePackMethod1 (line 3) | def zeroOnePackMethod1(self, weight: [int], value: [int], W: int):
    method zeroOnePackMethod2 (line 22) | def zeroOnePackMethod2(self, weight: [int], value: [int], W: int):