Graphs
71,513 Views
-
# Module library for mathematical graphs in Verse Graphs<public> := module: using { /Verse.org/Random } # Integer weighted graph IntegerWeightedGraph<public> := class<concrete>: Vertices:?[]int = false Edges:?[]tuple(int,int,int) = false AdjacencyList:?[int][]tuple(int,int) = false GetEdges<public>()<decides><transacts>:[]tuple(int,int,int) = Edges? GetVertices<public>()<decides><transacts>:[]int = Vertices? GetAdjacencyList<public>()<decides><transacts>:[int][]tuple(int,int) = AdjacencyList? DebugString<public>()<transacts>:string = var ReturnString: string = "" if (List:=AdjacencyList?): for (Vertex->VertexEdges:List): for(Edge:VertexEdges): set ReturnString += "\t{Vertex} - ({Edge(1)}) -> {Edge(0)}\n" ReturnString
You're reading a preview
The full reference is free for BrainDeadGuild Discord members — sign in to read it all, or open the original at the source.
Sign in with your BrainDead.TV / BrainDeadGuild Discord account for full access.