图：源代码

最新推荐文章于 2023-01-05 17:56:35 发布

Dream_wave

最新推荐文章于 2023-01-05 17:56:35 发布

阅读量169

点赞数

文章标签： python 图论

本文链接：https://blog.csdn.net/Dream_wave/article/details/120002518

版权

这篇博客详细介绍了图的源代码实现，包括两个图类的定义、图的遍历与生成树、最小生成树算法、最短路径算法、拓扑排序及关键路径和顶点间最短路径算法的应用。

摘要由CSDN通过智能技术生成

1. 两个图类的定义

""" topological sort of direct graph 
"""

infinity = float("inf")

class AdjGraphError(TypeError):
    pass

class Graph: # basic graph class, using adjacent matrix
    def __init__(self, mat, unconn = 0):
        vnum1 = len(mat)
        for x in mat:
            if len(x) != vnum1: # Check square matrix
                raise ValueError("Argument for 'GraphA' is bad.")
        self.mat = [mat[i][:] for i in range(vnum1)]
        self.unconn = unconn
        self.vnum = vnum1

    def vertex_num(self):
        return self.vnum

    def add_edge(self, vi, vj, val = 1):
        assert 0 <= vi < self.vnum and 0 <= vj < self.vnum
        self.mat[vi][vj] = val

    def add_vertex(self):
        raise AdjGraphError(
            "Adj Matrix does not support 'add_vertex'")

    def get_edge(self, vi, vj):
        assert 0 <= vi < self.vnum and 0 <= vj < self.vnum
        return self.mat[vi][vj]

    def out_edges(self, vi):
        assert 0 <= vi < self.vnum
        return self._out_edges(self.mat, vi, self.unconn)

    @staticmethod
    def _out_edges(mat, vi, unconn):
        edges = []
        row = mat[vi]
        for i in range(len(row)):
            if row[i] != unconn:
                edges.append((i, row[i]))
        return edges

    def __str__(self):
        return "[\n" + "\n".join(map(str, self.mat)) + "\n]"\
               + "\nUnconnected: " + str(infinity)

class GraphA(Graph):
    def __init__(self, mat, unconn = 0):
        vnum1 = len(mat)
        for x in mat:
            if len(x) != vnum1: # Check square matrix
                raise ValueError("Argument for 'GraphA' is bad.")
        self.mat = [Graph._out_edges(mat, i, unconn)
                        for i in range(vnum1)]
        self.vnum = vnum1
        self.unconn = unconn

    def add_vertex(self): # For new vertex, return an index allocated
        self.mat.append([])
        self.vnum += 1
        return self.vnum

    def add_edge(self, vi, vj, val = 1):
        assert 0 <= vi < self.vnum and 0 <= vj < self.vnum
        row = self.mat[vi]
        for i in range(len(row)):
            if row[i][0] == vj: # replace a value for mat[vi][vj]
                self.mat[vi][i] = (vj, val)
                return
            if row[i][0] > vj: break
        else:
            i += 1 # adjust for the new entry at the end
        self.mat[vi].insert(i, (vj, val))

    def get_edge(self, vi, vj):
        assert 0 <= vi < self.vnum and 0 <= vj < self.vnum
        for i, val in self.mat[vi]:
            if i == vj: return val
        return self.unconn

    def out_edges(self, vi):
        assert 0 <= vi < self.vnum
        return self.mat[vi]

        
if __name__ == '__main__':

##    g1 = Graph(10)
##    g2 = Graph(10, infinity)
##    print(str(g1))
##    print(str(g2))

    gmat = [[0,0,3,4],[2,0,0,0],[4,1,0,0],[2,0,1,0]]

    g3 = GraphA(gmat, 0)
    g3.add_edge(0,3,5)
    g3.add_edge(1,3,6)
    g3.add_edge(3,1,9)
    print(str(g3))

2. 图遍历和生成树

""" topological sort of direct graph 
"""

from Graph import *

from SStack import SStack, StackUnderflow
from SQueue import SQueue, QueueUnderflow

# Generate the DFS sequence of rearchable vertices from v0
def DFS_seq(graph, v0):
    vnum = grap