@author santi
Visibility
01 Syntax
Microsoft.VisualBasic.Data.visualize.Network.Layouts.Orthogonal.Visibility
02 Methods
| Name | Overloads | Summary |
|---|---|---|
| WVisibility | 1 | W-Visibility algorithm (reference) |
| WVisibility2Connected | 2 | 1,2: select (s,t) and generate an st-order. |
| copy | 1 | |
| gridAlign | 1 | |
| allPossibleWVisibility2Connected | 1 | |
| reorganize | 1 | |
| reorganizeAttempt | 1 | |
| moveSegment | 1 | |
| printResult | 1 | |
| sanityCheck | 1 |
03 Fields
| Name | Overloads | Summary |
|---|---|---|
| graph | 1 | |
| nEdges | 1 | |
| edgeIndexes | 1 | |
| edge_n1 | 1 | |
| edge_n2 | 1 | |
| horizontal_y | 1 | |
| horizontal_x1 | 1 | |
| horizontal_x2 | 1 | |
| vertical_x | 1 | |
| vertical_y1 | 1 | |
| vertical_y2 | 1 | |
| DEBUG | 1 |
04 Members
WVisibility
W-Visibility algorithm (reference)
WVisibility2Connected
1,2: select (s,t) and generate an st-order. Generate the graph D induced by the st-ordering
graph
nEdges
edgeIndexes
edge_n1
edge_n2
horizontal_y
horizontal_x1
horizontal_x2
vertical_x
vertical_y1
vertical_y2
DEBUG
copy(Visibility)
gridAlign(
Double)allPossibleWVisibility2Connected()
WVisibility2Connected(
Int32())reorganize()
reorganizeAttempt(
Boolean())moveSegment(
Int32, Double, Double)printResult()
sanityCheck()