327768f4ad
Use [33]byte for graph vertex representation. Delete unneeded stuff: 1. DeepEqual for graph comparison 2. EdgePath 3. 2-thread BFS 4. Table transfer messages and neighborhood radius 5. Beacons Refactor: 1. Change ID to Vertex 2. Test use table driven approach 3. Add comments 4. Make graph internal representation private 5. Use wire.OutPoint as EdgeId 6. Decouple routing messages from routing implementation 7. Delete Async methods 8. Delete unneeded channels and priority buffer from manager 9. Delete unneeded interfaces in internal graph realisation 10. Renamed ID to Vertex |
||
|---|---|---|
| .. | ||
| bfs_test.go | ||
| bfs.go | ||
| dijkstra_test.go | ||
| dijkstra.go | ||
| graph_test.go | ||
| graph.go | ||
| ksp_test.go | ||
| ksp.go | ||
| path.go | ||