ConjectureChecker
|
Class to store graph to know what to draw on canvas
vertices | Hashset to store vertices |
edge | List to store edges |
neigbors | Dictionary to store neighbors of all vertices |
Public Member Functions | |
void | AddToDictionary (Vertex key, Edge value) |
Safe version of adding to dictionary if value is not present, new list is created More... | |
void | SaveCoordinates () |
Function to save coordinates to file. More... | |
bool | Chech3AMKConjecture (int[,] AMKEdgesArray, int size) |
Check if the conjecture holds for given values of AMKEdgesArray More... | |
bool | Chech2AMKConjecture (int[,] AMKEdgesArray, int size) |
Check if the conjecture holds for given values of AMKEdgesArray More... | |
void | DeleteEdgeFromDictionary (Vertex from, Edge to) |
IEnumerable< Line > | GetLines (Vertex vertex) |
Get all lines incident to vertex so that first end is vertex More... | |
IEnumerable< Vertex > | GetVerticesAndIntersections () |
Get all vertices and intersection contained in graphCoordinates More... | |
Edge | FindEdgeFromVertices (Vertex a, Vertex b) |
Function to find edge between two vertices More... | |
Vertex | FindVertex (Point center) |
Function to find vertex with center equal to center . More... | |
Vertex | FindVertex (Ellipse ellipse, double sizeOfVertex) |
Function to find vertex containg ellipse More... | |
HashSet< Point > | GetAllPoints () |
Function to get all points from vertices More... | |
IEnumerable< Line > | LinesIterator () |
IEnumerable< Point > | PointsIterator () |
List< object > | PrintingLines () |
List< object > | PrintingLines (List< Line > listLines) |
List< object > | PrintingVertices () |
Public Attributes | |
HashSet< Vertex > | vertices = new HashSet<Vertex>() |
List< Edge > | edges = new List<Edge>() |
Dictionary< Vertex, List< Edge > > | neighbors = new Dictionary<Vertex, List<Edge>>() |
int [] | |
Static Public Attributes | |
static Point | farFarAway = new Point { X = 10000, Y = 10000 } |
static Point | facePoint = farFarAway |
static int | maximalKEdges = 8 |
Function to recalculate number of k edges and AM, AMAM, AMAMAM k edges It is done by finding all triangles upon all edges and counting k for every edge (also invariant counting is done) More... | |
Private Types | |
enum class | Difference { Zero , One , Two } |
Private Member Functions | |
void | PrintLine (StreamWriter streamWriter, Edge edge) |
Function to print given edge , meaning all its line segment More... | |
int[] | ReCalculateKEdges (List< Vertex > withouts=null, Edge withoutEdge=null) |
Static Private Attributes | |
static Brush[] | colors |
Class to store graph to know what to draw on canvas
vertices | Hashset to store vertices |
edge | List to store edges |
neigbors | Dictionary to store neighbors of all vertices |
|
strongprivate |
Safe version of adding to dictionary if value is not present, new list is created
key | |
value |
Check if the conjecture holds for given values of AMKEdgesArray
AMKEdgesArray | |
size |
Check if the conjecture holds for given values of AMKEdgesArray
AMKEdgesArray | |
size |
Function to find edge between two vertices
a | First vertex |
b | Second vertex |
|
inline |
Function to find vertex containg ellipse
ellipse |
|
inline |
Function to find vertex with center equal to center
.
center |
|
inline |
Function to get all points from vertices
graphCoordinates |
|
inline |
Get all lines incident to vertex
so that first end is vertex
vertex |
|
inline |
Get all vertices and intersection contained in graphCoordinates
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlineprivate |
Function to print given edge
, meaning all its line segment
streamWriter | |
edge |
|
inlineprivate |
|
inline |
Function to save coordinates to file.
|
staticprivate |
|
static |
|
static |
VizualizerWPF.GraphCoordinates.int[] |
|
static |
Function to recalculate number of k edges and AM, AMAM, AMAMAM k edges It is done by finding all triangles upon all edges and counting k
for every edge (also invariant counting is done)
Dictionary<Vertex, List<Edge> > VizualizerWPF.GraphCoordinates.neighbors = new Dictionary<Vertex, List<Edge>>() |