Discrete Math II - 10.1.1 Graphs and Graph Models

[@LiberalLover6969]

in my textbook, how you described directed multigraph is just a regular directed graph, and a true directed multigraph is a graph that has multiple edges going from one vertex to another. So like having two edges both going from A to B

[@xbz24]

Bridges of konigsberg, awesome thank you the story is really fascinating

[@egehanyildiz]

Im not sure if the Graph Model Practice part in the video is completely true, isnt there an issue on the vertices and edges related to 315 320 and 335 because if I want to take 335 I need to have a grade of at least C- in MA315 MA320 but at the same time I can not have MA320 without MA315 so basically I dont think there must be an edge that connects 315 to 335 directly rather it must be 315 to 320 to 335 and 315 to 335 must be omitted from the example. Please let me know if I'm right.

[@samkelly5277]

You're definitely right, but I believe it wouldn't be "incorrect" to make that relation in the graph. The graph is supposed to indicate relations between courses, and it makes sense to include 315 still in the prerequisites of 335 to make the relations clear between courses in the graph, rather than it be a graph showing pathway of courses to take. I'm not saying you're wrong but I don't think the graph necessarily has to be that detailed. Hope that makes sense.