🔻Graph Theory
🔻Via
🔻Combinatorics
🔻GraphTheory
Graph Theory
Description:
Also Known As:
&
- Node = (Neon, Ally, Protektor, Crop, Obstakle)
- (VIA.GraphTheory != RETE.GraphTheory)
- The structure of BETAGLOT isn't useful during Runtime? Maybe for ANIMA.Select(BETA), BETA.Alternatives
- ElasticSpacing probably uses weighted graphs
- What is a synonym for "weight" so it's not confused with the Physical Force
- ActualName(EnumeratedGraph) which node to go first? Returning to a Node is Deadwalking, since you should be return to a Mikrosite
- ContinuousGraph
- DiscontinuousGraph
- relationships don't need to be adjacent