-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbuildgraph.h
More file actions
41 lines (35 loc) · 1.31 KB
/
Copy pathbuildgraph.h
File metadata and controls
41 lines (35 loc) · 1.31 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
////////////////////////////////////////////////////////////////////////////////
// Main File: main.c
// This File: buildgraph.h
// Other Files: progexe.c progexe.h Textparsing.c Textparsing.h
// linkedlist.c linkedlist.h buildgraph.c buildrepr.c
// buildrepr.h
// Semester: CS 537 Fall 2018
//
// Author: Youmin Han
// Email: youmin.han@wisc.edu
// CS Login: youmin
//
// Author: Xianjie Zheng
// Email: xzheng97@wisc.edu
// CS Login: xianjie
//
/////////////////////////// OTHER SOURCES OF HELP //////////////////////////////
// fully acknowledge and credit all sources of help,
// other than Instructors and TAs.
//
// Persons: NULL
//
// Online sources: NULL
//
//////////////////////////// 80 columns wide ///////////////////////////////////
#ifndef buildgraph_h
#define buildgraph_h
#include <stdio.h>
#include "buildrepr.h"
#include "linkedlist.h"
struct LinklistNode* buildgraph(struct LinklistNode* head, char * inputarray);
int detectcycle(struct node* head, struct LinklistNode* order, struct LinklistNode* path);
void resetvisited(struct LinklistNode* head);
int contains(struct LinklistNode** headref, struct node* linkednode);
#endif /* buildgraph_h */