Summary Networks
Summary Networks
AND NETWORKS
Simple/single
Connection
Simple
Graph
Isolated
Vertex
Degree
Of Face
Bipartite
Graph
Adjacency
Matrix
Connected
Edges
Complete
Graph
Face/
Region
Vertices/
Modes
Incidence
Matrix
Circuit
Loops
Graphs and
Subgraphs
Vertex
Degree
Path
Parallel/
Multiple
Edges
Planar Graphs
Degenerate/
Null Graph
PATHS & CIRCUITS
Eulers
formula
Euler Path
Euler
Circuit
Hamiltonian
Path
Hamiltonian
Circuit
TREES
Shortest
Path
Weighted
Graph
Cycle
Prims
Algorithm
Minimum
Spanning
Tree
Spanning
Tree
Maximum
Spanning
Tree
REACHABILITY AND
DOMINANCE
Three-step
One-step
Two-step
Dominance
Vector
Total
Reachability
ALLOCATION
Hungarian
Alorithm
Row
Reduction
Column
Reduction
Final
Answer
Maximising
Allocation
Bipartite
Graphs
NETWORK FLOW
Direction of Flow through Cut
Source Sink
Start - Terminal
Valid Cuts
Maximum
Flow
Minimum
Cut
CRITICAL PATH
ANALYSIS
Immediate
Predecessor
Forward
Scan
EST/ LST/
EFT/ LFT
Critical
Path
Constructing
Networks
Backward
Scan
Float
Crashing
ECT
Dummies