_The program prompts user for an input file that describes a graph. The graph file is described by the following parameters:
- The first line contains the graph name. (<= 20 characters)
- The second line contains the number of vertices on the graph. (2 <= vertices <= 20)
- The third line contains the number of edges in the graph. (edges <= vertices)
- The following lines contain ordered pairs that describe the edges in the form (v1,v2).
- The final line contains the start vertex for the searches.
The program uses the graph described in this file to run a demo breadth-first and depth-first search. These searches traverse the entire graph and print the vertices they visit in order without repeating vertices that are visited more than once._
- Download source code to an empty directory.
- Run 'make' from the command line.
- Run sdriver and input the name of a file describing a graph (see above for format).
Contact me at cne.embrey@gmail.com
C language.
Copyright (c) 2016 {Nick Embrey}
*Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.*