úÎ Þj     Safe^?An IntGraph is a maping of Ints (Nodes) to sets of Nodes (Ints)An edge is a pair of nodesA NodeSet is a Set 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 graph 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   Safe§ 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    SafeE      'IntGraph-0.1.0.0-Ghr5S1rBRHHKu7MyE7RRJIData.IntGraph.DirectedData.IntGraph.Undirected Data.IntGraphPaths_IntGraphIntGraphEdgeNodeSetNodeaddNodenodes removeNodeemptyaddEdgeedges removeEdge fromEdgesIGadjacencyToListversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName