Files
2022-12-16 13:54:26 -06:00

60 lines
1.8 KiB
C++

#include <wchar.h>
#include <locale>
#include <codecvt>
#include <string>
#include <iostream>
#include <iomanip>
#include "main.h"
int main ( int, char ** ) {
//test1 ();
//test2 (); // graph shows way more than is added, i can't used a large number for an index. should move back to custom structs.. and figure out how to make those into subgraphs.
//test3 (); // back to basics, this shows making a basic graph with arrays. again an int is used as a base
//test4 (); // basic no subgraph custom structure.
//test5 ();
test6 (); // look though vertices
//test7 (); // look though edges instead
// okay here is how i think this should work if i can get this boost shit going.
// legs will be designated either test set side or test adapter side
// for each pin on the test adapter side we will look up the path that it takes.
// we will section off everything according to cable legs.
// each graph will have a length between pins
// length = 0
// if the pins are on the test set side then this a one off test and will be from a to b
// if the pins are on the adapter side then this an isolated pair and needs to be attached to a length of one pin pair
// length = 1
// this is going to the bulk of our pins
// so pin 'a' will be on the test set side and pin 'b' will be on the adapter side
// it's from this set of tests that will we have to steal pin pairs from to test isolated, length 0, and loop pins, length > 1
// length > 1
// these pin sets will have to broken down as much as possible givin the pool of length 1 pairs
// p1-001 -> P1-002 : length 0
// P1-001 -> P2-001 : length 1
// P1-001 -> P2-001 : length 2
// -> P2-002
// Nearby nodes
// edge has been visted
// check for orphans
//
return 0;
}