úÎ x†     SafeV ?An IntGraph is a maping of Ints (Nodes) to sets of Nodes (Ints)An edge is a pair of nodesA NodeSet is a IntSet of NodesThe nodes of the graph are IntsPAdds a single node with no neighbors. | If node already in graph, does nothing.(Returns a list of the nodes in the graph)removes a node and all its incident edgesthe empty graphIs the graph empty Is the edge set empty4Joins to graphs by unioning the vertex and edge sets  Safe ù kAdd an edge to the graph | If either of the nodes are not already present in the graph, | They are added.4Turns a node with its adjecencies to a list of edges (Returns a list of all edges in the graph Remove an edge from the graph "Turns a list of edges into a graph   SafeO_If there is a vertex cover of size k, returns the vertex cover | Otherwise Nothing | O(n*2^k).vertexCoverDec, but just returns true or falseYOptimal vertex cover | Not all that efficient, just keeps trying difference values for kSafeµWAdd an edge to the graph | If either nodes is not already in the graph, they are added(Returns a list of all edges in the graphremove an edge from the graph"turns a list of edges into a graph  Safe _If there is a vertex cover of size k, returns the vertex cover | Otherwise Nothing | O(n*2^k).vertexCoverDec, but just returns true or falseYOptimal vertex cover | Not all that efficient, just keeps trying difference values for kSafea !"#      !"#'IntGraph-0.1.1.0-DW0ZH847ObXBagXkSFxTvpData.IntGraph.Directed!Data.IntGraph.Directed.AlgorithmsData.IntGraph.Undirected#Data.IntGraph.Undirected.Algorithms Data.IntGraphPaths_IntGraphIntGraphEdgeNodeSetNodeaddNodenodes removeNodeemptynull nullEdgesaddEdgeedges removeEdge fromEdgesvertexCoverDecvertexCoverBool vertexCoveroverlayIGadjacencyToListversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName