Trying to make a Matrix of nodes in Python

Hey /prog/rammers, I'm trying to make a Matrix of nodes in python.
so far I have a node class that reads as such:

class Node (object) :
   
    def __init__(self, value):
        self.north = None
        self.east = None
        self.south = None
        self.west = None
        self.value = value
       
    def getNorth(self):
        return self.north
       
    def getSouth(self):
        return self.south
       
    def getEast(self):
        return self.east
       
    def getWest(self):
        return self.west
       
    def getValue(self):
        return self.value


And a LinkedMatrix class that reads like this:

class LinkedMatrix(object):
   
    def __init__(self, x, y, defaultValue):
       
        ''' create a new matrix with x columns and y rows
        with default value default value'''
       
        self._xRows = x
        # x amt of rows
        self._yCols = y
        # y amt of columns
       
        base_node=Node(defaultValue)
        self.head = Node(defaultValue)
       
        self.mlist = []
        self.head.east=base_node
        self.mlist = [self.head]
        for number in range(self._yCols):
            base_node.east=Node(defaultValue)
            self.mlist = self.mlist + [base_node]
       
     
     
       
       
       
 Im thinking I should make a list of the nodes in python and then make a list of lists, but Im having trouble wording my code so that the nodes properly connect to each other, and I also am wondering how I can make their connections (north and south) work across different lists.

Help is very needed and would be very appreciated.

Making progress...
I made a for loop inside a for loop that properly nests the nodes in the matrix and makes many different nodes at different points in memory

Now I need to figure out how to make a __str__ definition that will give a proper string representation instead of showing where the nodes are located in memory


 for number in range(self._xRows) :
            self.mlist = [] #empty list meant to contain future nodes
            for number in range (self._yCols) :
                base_node=Node(defaultValue)
                self.mlist = self.mlist + [base_node]
            self.matrix = self.matrix +[self.mlist]

Thou shalt not use Python.

LETS FUCKING GO!!!!!!!


 def __str__ (self):
       
        '''returns the string representation of the matrix'''

        stringmatrix=[]
        for item in self.matrix:
            stringmlist=[]
            for node in item:
                a=str(node.getValue())
                stringmlist=stringmlist+[a]
            stringmatrix = stringmatrix + [stringmlist]
        for item in stringmatrix:
            print (item)
       
        return ''
   
IM BALLIN OUT HERE, /prog/!
IM NEW TO THIS PROGRAMMING SHIT BUT GIVE ME TIME
IM ABOUT TO BECOME A MASTER

>>3
Im forced to use it for my class. The worst part with this project isnt even using python. Its that there are built in lists and making a matrix could be so much easier than what Im doing with these damn nodes.

read sicp

>>6
is there anything about linked matrices in there? Or is it just the basic linked list ?

Terrible !

>>8
My nose has no dog. Then how does he exist? Terrible!

>>8
>>9
I dont understand what you're trying to say here

>>10
He means "go the fuck back to /g/"

>>11
but this is programming

>>12
This is /home/work, not /prog/ramming. Go back to /home/.

>>13
You guys arent even helping me, Im just documenting this shit

also

def __getitem__(self, index):
        '''return the element at the index expressed as a tuple'''
        x,y = index
        #return "fetching %s, %s" % (x, y)
        stringmatrix=[]
        for item in self.matrix:
            stringmlist=[]
            for node in item:
                a= str(node.getValue())
                stringmlist=stringmlist+[a]
            stringmatrix = stringmatrix + [stringmlist]
        get = stringmatrix[x][y]
        print (get)

>>11
>le pedophile sage

HAXUS THE PEDOPHILE SAGE

>>16
>le haxus the pedophile sage

Seems like you need a graph.